The complexity of geometric scaling

DOI10.1016/J.ORL.2023.11.010MaRDI QIDQ6556153zbMATH OpenFDO

Authors Antoine Deza, Sebastian Pokutta, Lionel Pournin

Publication date 17 June 2024

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2023.11.010

zbMATH Keywords

augmentation algorithmsgeometric scalinginteger optimization

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• 0/1-Integer programming: Optimization and Augmentation are equivalent
• An application of simultaneous diophantine approximation in combinatorial optimization
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• Integral simplex using decomposition for the set partitioning problem
• Log-Barrier Interior Point Methods Are Not Strongly Polynomial
• Primitive point packing
• Restarting algorithms: sometimes there is free lunch
• Short simplex paths in lattice polytopes
• Solving MIPs via scaling-based augmentation
• The Complexity of Generic Primal Algorithms for Solving General Integer Programs
• The diameter of lattice zonotopes
• What Tropical Geometry Tells Us about the Complexity of Linear Programming

This page was built for publication: The complexity of geometric scaling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556153)