Book Review: The basic George B. Dantzig
From MaRDI portal
Publication:5494765
DOI10.1090/S0273-0979-2010-01303-3zbMath1292.00042OpenAlexW2330875613WikidataQ56049007 ScholiaQ56049007MaRDI QIDQ5494765
Publication date: 29 July 2014
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0273-0979-2010-01303-3
Linear programming (90C05) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03) External book reviews (00A17)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- The simplex method. A probabilistic analysis
- Geometric algorithms and combinatorial optimization
- Linear programming, the simplex algorithm and simple polytopes
- The many facets of linear programming
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Lectures on Modern Convex Optimization
- New results on the average behavior of simplex algorithms
- Semidefinite optimization
- Smoothed analysis of algorithms
- Interior-point methods for optimization
- Solving Real-World Linear Programs: A Decade and More of Progress
- Feature Article—The Ellipsoid Method: A Survey
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- Lectures on Polytopes
- On the History of Combinatorial Optimization (Till 1960)