Finding a bounded mixed-integer solution to a system of dual network inequalities
From MaRDI portal
Publication:957371
DOI10.1016/j.orl.2008.04.004zbMath1157.15021OpenAlexW2066399276MaRDI QIDQ957371
Publication date: 27 November 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2008.04.004
schedulingeigenvectormax-algebrapseudopolynomial algorithmbounded mixed-integer solutiondual network inequalities
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
On tropical supereigenvectors ⋮ On integer images of max-plus linear mappings ⋮ A note on tropical linear and integer programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generators, extremals and bases of max cones
- Minimax algebra and applications
- A decomposition algorithm for optimality problems in tree-structured networks
- A max version of the Perron-Frobenius theorem
- Max algebra and the linear assignment problem
- Max-algebra: The linear algebra of combinatorics?
- Network Formulations of Mixed-Integer Programs
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Pattern Properties and Spectral Inequalities in Max Algebra
- Applications of max algebra to diagonal scaling of matrices
This page was built for publication: Finding a bounded mixed-integer solution to a system of dual network inequalities
