Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization

Short Simplex Paths in Lattice Polytopes

(2021) Alberto Del Pia et al.   DISCRETE & COMPUTATIONAL GEOMETRY

On the Circuit Diameter of Some Combinatorial Polytopes

(2019) Sean Kafer et al.   SIAM JOURNAL ON DISCRETE MATHEMATICS

A polyhedral model for enumeration and optimization over the set of circuits

(2019) Steffen Borgwardt et al.   DISCRETE APPLIED MATHEMATICS

Computing Kitahara–Mizuno’s bound on the number of basic feasible solutions generated with the simplex algorithm

(2018) Takahito Kuno et al.   Optimization Letters

Edges versus circuits: a hierarchy of diameters in polyhedra

(2016) S. Borgwardt et al.   ADVANCES IN GEOMETRY

An exponential lower bound for Cunningham’s rule

(2016) David Avis et al.   MATHEMATICAL PROGRAMMING

Elementary Vectors and Conformal Sums in Polyhedral Geometry and their Relevance for Metabolic Pathway Analysis

(2016) Stefan Müller et al.   Frontiers in Genetics

On the Circuit Diameter of Dual Transportation Polyhedra

(2015) Steffen Borgwardt et al.   SIAM JOURNAL ON DISCRETE MATHEMATICS

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond

(2015) Jesús A. De Loera et al.   SIAM JOURNAL ON OPTIMIZATION

Decomposition theorems for linear programs

(2014) Jean Bertrand Gauthier et al.   OPERATIONS RESEARCH LETTERS

Fractional perfect b -matching polytopes I: General theory

(2013) Roger E. Behrend   LINEAR ALGEBRA AND ITS APPLICATIONS

A bound for the number of different basic solutions generated by the simplex method

(2011) Tomonari Kitahara et al.   MATHEMATICAL PROGRAMMING

A polynomial oracle-time algorithm for convex integer minimization

(2009) Raymond Hemmecke et al.   MATHEMATICAL PROGRAMMING