A polynomial oracle-time algorithm for convex integer minimization
- 6 March 2009
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 126 (1), 97-117
- https://doi.org/10.1007/s10107-009-0276-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- -fold integer programmingDiscrete 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
- All Linear and Integer Programs Are Slim 3‐Way Transportation ProgramsSIAM Journal on Optimization, 2006
- On deviation measures in stochastic integer programmingOperations Research Letters, 2005
- Optimality criterion for a class of nonlinear integer programsOperations Research Letters, 2004
- The Complexity of Three-Way Statistical TablesSIAM Journal on Computing, 2004
- 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