|
|
|||
|
||||
OverviewThe 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. Full Product DetailsAuthor: K. Aardal (Centrum voor Wiskunde en Informatica, 1090 GB, Amsterdam, The Netherlands) , George L. Nemhauser (School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA) , R. Weismantel (Otto-von-Guericke-University of Magdeburg, 39106 Magdeburg, Germany)Publisher: Elsevier Science & Technology Imprint: North-Holland Volume: v. 12 Dimensions: Width: 16.50cm , Height: 4.20cm , Length: 24.00cm Weight: 1.280kg ISBN: 9780444515070ISBN 10: 0444515070 Pages: 620 Publication Date: 08 December 2005 Audience: Professional and scholarly , Professional & Vocational Format: Hardback Publisher's Status: Out of Print Availability: In Print Limited stock is available. It will be ordered for you and shipped pending supplier's limited stock. Table of Contents1. On the History of Combinatorial Optimization (till 1960) (A. Schrijver). 2. Computational Integer Programming and Cutting Planes (A. Fügenschuh, 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. Cornuéjols, 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).ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |