Projects per year
Abstract
Max-linear programs have been used to describe optimisation problems for multiprocessor interactive systems. In some instances the variables used in this model are required to be integer; however, no method seems to exist for finding integer solutions to max-linear programs.
For a generic class of matrices, we show that integer solutions to two-sided max-linear systems and programs can be found in polynomial time. For general matrices, we adapt the existing methods for finding real solutions to obtain algorithms for finding integer solutions.
For a generic class of matrices, we show that integer solutions to two-sided max-linear systems and programs can be found in polynomial time. For general matrices, we adapt the existing methods for finding real solutions to obtain algorithms for finding integer solutions.
Original language | English |
---|---|
Pages (from-to) | 128–141 |
Journal | Discrete Applied Mathematics |
Volume | 162 |
Early online date | 13 Sept 2013 |
DOIs | |
Publication status | Published - 10 Jan 2014 |
Keywords
- Max-linear system
- Integer vector
- Max-linear program
Fingerprint
Dive into the research topics of 'On the integer max-linear programming problem'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Perron-Frobenius Theory and Max-Algebraic Combinatorics of Nonnegative Matrices
Butkovic, P.
Engineering & Physical Science Research Council
12/03/12 → 11/03/14
Project: Research Councils