A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 219-229
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Convex integer maximization via Graver basesJournal of Pure and Applied Algebra, 2009
- A polynomial oracle-time algorithm for convex integer minimizationMathematical Programming, 2009
- A note on second-order stochastic dominance constraints induced by mixed-integer linear recourseMathematical Programming, 2009
- -fold integer programmingDiscrete Optimization, 2008
- New Formulations for Optimization under Stochastic Dominance ConstraintsSIAM Journal on Optimization, 2008
- A finiteness theorem for Markov bases of hierarchical modelsJournal of Combinatorial Theory, Series A, 2007
- Finiteness Theorems in Stochastic Integer ProgrammingFoundations of Computational Mathematics, 2006
- On the positive sum property and the computation of Graver test setsMathematical Programming, 2003
- Decomposition of test sets in stochastic integer programmingMathematical Programming, 2003
- On the foundations of linear and integer linear programming IMathematical Programming, 1975