Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization

22 Oct 2020 De Loera Jesús A. Kafer Sean Sanità Laura

Circuit-augmentation algorithms are generalizations of the Simplex method, where in each step one is allowed to move along a fixed set of directions, called circuits, that is a superset of the edges of a polytope. We show that in the circuit-augmentation framework the greatest-improvement and Dantzig pivot rules are NP-hard, already for 0/1-LPs... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS
  • DISCRETE MATHEMATICS
  • OPTIMIZATION AND CONTROL