Handbooks in Operations Research and Management Science: Volume 12
Discrete Optimization
Published on 8. December 2005
Book
Hardback
620 pages
978-0-444-51507-0 (ISBN)
Description
The chapters of this Handbook volume cover nine main topics that are representative of recenttheoretical and algorithmic developments in the field. In addition to the nine papers that present the state of the art, there is an article on the early history of the field.
The handbook will be a useful reference to experts in the field as well as students and others who want to learn about discrete optimization.
The handbook will be a useful reference to experts in the field as well as students and others who want to learn about discrete optimization.
More details
Series
Language
English
Place of publication
United States
Publishing group
Elsevier Science & Technology
Target group
Professional and scholarly
Operation Researchers
Product notice
Laminated cover
Dimensions
Height: 234 mm
Width: 156 mm
Thickness: 33 mm
Weight
1039 gr
ISBN-13
978-0-444-51507-0 (9780444515070)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
K. Aardal | George L. Nemhauser | R. Weismantel
Handbooks in Operations Research and Management Science
Discrete Optimization
E-Book
12/2005
Elsevier
€205.00
Available for download
Persons
Content
1. On the History of Combinatorial Optimization (till 1960) (A. Schrijver). 2. Computational Integer Programming and Cutting Planes (A. Fuegenschuh, A. Martin). 3. The Structure of Group Relaxations (R. R. Thomas). 4. Integer programming, lattices, and results in fixed dimension (K. Aardal, F. Eisenbrand). 5. Primal Integer Programming (B. Spille, R. Weismantel). 6. Balanced Matrices (G. Cornuejols, M. Conforti). 7. Submodular Function Minimization (T. McCormick). 8. Semidefinite Programming and Integer Programming (M. Laurent, F. Rendl). 9. Algorithms for Stochastic Mixed-Integer Programming Models (S. Sen). 10. Constraint Programming (A. Bockmayr, J.N. Hooker).