Book Review: The basic George B. Dantzig
From MaRDI portal
Publication:5494765
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
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 429689 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 3244470 (Why is no real title available?)
- A mathematical view of interior-point methods in convex optimization
- A new polynomial-time algorithm for linear programming
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- Feature Article—The Ellipsoid Method: A Survey
- Geometric algorithms and combinatorial optimization
- Interior-point methods for optimization
- Lectures on Polytopes
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear programming, the simplex algorithm and simple polytopes
- Moments, positive polynomials and their applications
- New results on the average behavior of simplex algorithms
- On the History of Combinatorial Optimization (Till 1960)
- 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
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)
