Projects per year
We show that using max-algebraic techniques it is possible to generate the set of all solutions to a system of inequalities x(i) - x(j) >= b(ij), i,j = 1,..., n using n generators. This efficient description enables us to develop a pseudopolynomial algorithm which either finds a bounded mixed-integer solution, or decides that no such solution exists. (c) 2008 Elsevier B.V. All rights reserved.
|Number of pages||5|
|Journal||Operations Research Letters|
|Publication status||Published - 1 Sept 2008|
- Dual network inequalities
FingerprintDive into the research topics of 'Finding a bounded mixed-integer solution to a system of dual network inequalities'. Together they form a unique fingerprint.
- 1 Finished
Feasibility and Reachability in Max-Linear Systems
Engineering & Physical Science Research Council
1/02/08 → 30/04/11
Project: Research Councils