The complexity of geometric scaling

DOI10.1016/j.orl.2023.11.010MaRDI QIDQ6556153

Sebastian Pokutta, Antoine Deza, Lionel Pournin

Publication date: 17 June 2024

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

zbMATH Keywords

geometric scalinginteger optimizationaugmentation algorithms

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• An application of simultaneous diophantine approximation in combinatorial optimization
• Solving MIPs via scaling-based augmentation
• Restarting algorithms: sometimes there is free lunch
• Short simplex paths in lattice polytopes
• Integral Simplex Using Decomposition for the Set Partitioning Problem
• Log-Barrier Interior Point Methods Are Not Strongly Polynomial
• The diameter of lattice zonotopes
• What Tropical Geometry Tells Us about the Complexity of Linear Programming
• The Complexity of Generic Primal Algorithms for Solving General Integer Programs
• Primitive point packing
• 0/1-Integer programming: Optimization and Augmentation are equivalent

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