Linear Programming and Network Flows, 4th EditionISBN: 978-0-470-46272-0
Hardcover
768 pages
December 2009
 This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 15-20 days delivery time. The book is not returnable.
|
||||||
- Provides a new section on LU decomposition for stable computations as well as more efficient dual updates schemes using LU factors
- Presents new discussions on the geometry of cycling and provides insights into the nature and construction of examples that admit cycling
-
Elaboration on stable factorizations and implementation strategies
-
Stabilized column generation and acceleration of Benders and Dantzig-Wolfe decomposition methods
-
Additional information or polynomial time algorithms for linear programs
-
Line search and dual ascent ideas for the out-of-kilter algorithm
-
Heap implementation comments, negative cost circuit insights, and additional convergence analyses for shortest path problems
-
The exercises in several chapters have been revised and expanded
-
The Notes and References sections for all the chapters have been updated, along with the bibliography
Related Titles
More By These Authors
Science
Read an Excerpt
.png){kind=small}
Join An E-mail ListLearn about the latest products, events, offers and content. |
