Book Review: The basic George B. Dantzig
DOI10.1090/S0273-0979-2010-01303-3zbMATH Open1292.00042OpenAlexW2330875613WikidataQ56049007 ScholiaQ56049007MaRDI QIDQ5494765FDOQ5494765
Authors: Michael J. Todd 
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) External book reviews (00A17) 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)
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lectures on Polytopes
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- A mathematical view of interior-point methods in convex optimization
- Title not available (Why is that?)
- Moments, positive polynomials and their applications
- Semidefinite optimization
- Smoothed analysis of algorithms
- Solving Real-World Linear Programs: A Decade and More of Progress
- The many facets of linear programming
- The simplex method. A probabilistic analysis
- Feature Article—The Ellipsoid Method: A Survey
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- On the History of Combinatorial Optimization (Till 1960)
- Linear programming, the simplex algorithm and simple polytopes
- Interior-point methods for optimization
- Title not available (Why is that?)
- New results on the average behavior of simplex algorithms
Cited In (1)
This page was built for publication: Book Review: The basic George B. Dantzig
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494765)
