A colorful Steinitz lemma with application to block-structured integer programs

DOI10.1007/s10107-023-01971-3arXiv2201.05874OpenAlexW4376874338WikidataQ124838999 ScholiaQ124838999MaRDI QIDQ6120853

Joseph Paat, Robert Weismantel, Timm Oertel

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.05874

zbMATH Keywords

discrete geometrySteinitz lemmablock structured integer programs

Mathematics Subject Classification ID

Integer programming (90C10) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cites Work

• Unnamed Item
• Unnamed Item
• Small subset sums
• Vectors in a box
• \(N\)-fold integer programming
• Value of the Steinitz constant
• A generalization of Caratheodory's theorem
• Geometric algorithms and combinatorial optimization
• \(n\)-fold integer programming in cubic time
• Distances to lattice points in knapsack polyhedra
• Combinatorial \(n\)-fold integer programming and applications
• Improving proximity bounds using sparsity
• Distances between optimal solutions of mixed-integer programs
• The master equality polyhedron with multiple rows
• Helly’s theorem: New variations and applications
• A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs
• Sensitivity theorems in integer linear programming
• Two‐stage stochastic integer programming: a survey
• Faster Algorithms for Integer Programs with Block Structure
• A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
• On Integer Programming and Convolution.
• Efficient Sequential and Parallel Algorithms for Multistage Stochastic Integer Programming Using Proximity

This page was built for publication: A colorful Steinitz lemma with application to block-structured integer programs