Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- 16 February 2013
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 145 (1-2) , 1-18
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- n-Fold integer programming in cubic timeMathematical Programming, 2011
- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer ProgramsLecture Notes in Computer Science, 2010
- 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
- On the positive sum property and the computation of Graver test setsMathematical Programming, 2003
- Decomposition of test sets in stochastic integer programmingMathematical Programming, 2003
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization ProblemsMathematics of Operations Research, 1994
- On the foundations of linear and integer linear programming IMathematical Programming, 1975