The many facets of linear programming

2002/02/01 by Michael J. Todd · 107 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Optimization Algorithms Research #Constraint Satisfaction and Optimization #Linear programming #Mathematical analysis #Mathematical optimization #Mathematics #Numerical analysis

paper · doi:10.1007/s101070100261

published in Mathematical Programming 91(3), 417-436 (Springer Science and Business Media LLC)

crossref issued 2002/02/01 · crossref published 2002/02/01 · crossref published-print 2002/02/01 · openalex publication_date 2002/02/01 · crossref created 2003/03/24 · crossref published-online 2014/04/20 · crossref deposited 2019/05/29 · openalex created_date 2025/10/10 · crossref indexed 2026/07/13 · openalex updated_date 2026/07/23

Citations

• The d-step conjecture for polyhedra of dimension d<6
• The hirsch conjecture is true for (0, 1)-polytopes
• Linear Programming in Linear Time When the Dimension Is Fixed
• The Relaxation Method for Solving Systems of Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• A quasi-polynomial bound for the diameter of graphs of polyhedra

Cited by

• Bland's rule [wikipedia]