Projects per year
We study the existence of integer solutions to max-linear optimization problems. Specifically, we show that, in a generic case, the integer max-linear optimization problem can be solved in strongly polynomial time. This extends results from our previous papers where polynomial methods for this generic case were given.
|Number of pages||23|
|Journal||Journal of Optimization Theory and Applications|
|Early online date||24 Jun 2014|
|Publication status||Published - 2015|
- Max-linear optimization problem
- Integer vector
- Max-linear system
FingerprintDive into the research topics of 'A strongly polynomial method for solving integer max-linear optimization problems in a generic case'. Together they form a unique fingerprint.
- 1 Finished
Perron-Frobenius Theory and Max-Algebraic Combinatorics of Nonnegative Matrices
Engineering & Physical Science Research Council
12/03/12 → 11/03/14
Project: Research Councils