Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

DOI10.1007/s11750-013-0293-9zbMath1280.52012OpenAlexW4236046070MaRDI QIDQ384507

Tamás Terlaky

Publication date: 28 November 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-013-0293-9

zbMATH Keywords

polyhedradiameterlinear optimizationcentral pathHirsch conjecturepivot algorithms

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rejoinder on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes
• Polytopes and arrangements: diameter and curvature
• A continuous \(d\)-step conjecture for polytopes
• A finite crisscross method for oriented matroids
• Criss-cross methods: A fresh view on pivot algorithms
• On the curvature of the central path of linear programming theory
• A convergent criss-cross method
• The Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
• Diameter and Curvature: Intriguing Analogies
• Interior Point Methods for Linear Optimization