Secure CheckoutPersonal information is secured with SSL technology.
Free ShippingFree global shipping
No minimum order.
- 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).
The chapters of this Handbook volume cover nine main topics that are representative of recent
theoretical 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.
- No. of pages:
- © North Holland 2006
- 8th December 2005
- North Holland
- Hardcover ISBN:
- eBook ISBN:
Centrum voor Wiskunde en Informatica, 1090 GB, Amsterdam, The Netherlands
School of Industrial & Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA
Otto-von-Guericke-University of Magdeburg, 39106 Magdeburg, Germany
Elsevier.com visitor survey
We are always looking for ways to improve customer experience on Elsevier.com.
We would like to ask you for a moment of your time to fill in a short questionnaire, at the end of your visit.
If you decide to participate, a new browser tab will open so you can complete the survey after you have completed your visit to this website.
Thanks in advance for your time.