Abstract
Geometric scaling, introduced by Schulz and Weismantel in 2002, solves the integer optimization problem max{c⋅x:x∈P∩Zn} by means of primal augmentations, where P⊂Rn is a polytope. We restrict ourselves to the important case when P is a 0/1-polytope. Schulz and Weismantel showed that no more than O(nlog2n‖c‖∞) calls to an augmentation oracle are required. This upper bound can be improved to O(nlog2‖c‖∞) using the early-stopping policy proposed in 2018 by Le Bodic, Pavelka, Pfetsch, and Pokutta. Considering both the maximum ratio augmentation variant of the method as well as its approximate version, we show that these upper bounds are essentially tight by maximizing over a n-dimensional simplex with vectors c such that ‖c‖∞ is either n or 2n.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
