Graver basis and proximity techniques for block-structured separable convex integer minimization problems
From MaRDI portal
Publication:2248743
DOI10.1007/s10107-013-0638-zzbMath1298.90057arXiv1207.1149OpenAlexW3106527427MaRDI QIDQ2248743
Matthias Köppe, Raymond Hemmecke, Robert Weismantel
Publication date: 27 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.1149
stochastic integer programmingpolynomial-time algorithmproximityGraver basisaugmentation algorithm\(N\)-fold integer programsstochastic multi-commodity flow
Related Items
On two theorems about local automorphisms of geometric structures, Solving MIPs via scaling-based augmentation, A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs, High-multiplicity \(N\)-fold IP via configuration LP, The power of pyramid decomposition in Normaliz, Unnamed Item, Combinatorial \(n\)-fold integer programming and applications, Unnamed Item, Scheduling meets \(n\)-fold integer programming, Unnamed Item, Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse
- A polynomial oracle-time algorithm for convex integer minimization
- Optimality criterion for a class of nonlinear integer programs.
- \(N\)-fold integer programming
- Nonlinear discrete optimization. An algorithmic theory
- Convex integer maximization via Graver bases
- Decomposition of regular matroids
- Decomposition of test sets in stochastic integer programming
- On the positive sums property and the computation of Graver test sets
- Convex combinatorial optimization
- \(n\)-fold integer programming in cubic time
- Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
- Theory and Applications of n-Fold Integer Programming
- The stochastic multicommodity flow problem
- A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
- Solving integer minimum cost flows with separable convex cost objective polynomially
- On the foundations of linear and integer linear programming I
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Convex separable optimization is not much harder than linear optimization
- 0/1-Integer programming: Optimization and Augmentation are equivalent
