Projects per year
Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 941-963 |
Number of pages | 23 |
Journal | Journal of Optimization Theory and Applications |
Volume | 165 |
Issue number | 3 |
Early online date | 24 Jun 2014 |
DOIs | |
Publication status | Published - 2015 |
Keywords
- Max-linear optimization problem
- Integer vector
- Max-linear system
- 15A80
Fingerprint
Dive 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.Projects
- 1 Finished
-
Perron-Frobenius Theory and Max-Algebraic Combinatorics of Nonnegative Matrices
Butkovic, P. (Principal Investigator)
Engineering & Physical Science Research Council
12/03/12 → 11/03/14
Project: Research Councils