Concepts of Combinatorial Optimization: Pt. 1

Edited by Vangelis Th. Paschos

Concepts of Combinatorial Optimization: Pt. 1

Edited by Vangelis Th. Paschos

Publisher: ISTE Ltd and John Wiley & Sons Inc

Series: Combinatorial Optimization

List price: £ 107.00

Deastore.com price (info) € 144.90

Format: Hardback

Publication date: 05 May 2010

Availability: (info) Not available

ISBN: 1848211473 ISBN 13: 9781848211476

Concepts of Combinatorial Optimization: Pt. 1

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. Part of the "Combinatorial Optimization" series, this title aims to cover a wide range of topics in this area. Top page

Complete description

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. "Concepts of Combinatorial Optimization", is divided into three parts: on the complexity of combinatorial optimization problems, that presents basics about worst-case and randomized complexity; classical solution methods, that presents the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; and, elements from mathematical programming, that presents fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field. Top page

General info

Publisher & Imprint: ISTE Ltd and John Wiley & Sons Inc

City: London

Pages: 368

Top page

Age recommended: College/higher education

Summary Concepts of Combinatorial Optimization: Pt. 1 Part 1: On The Complexity of Combinatorial Optimization Problems 1. Basic Concepts from Algorithms and Complexity, Vangelis Th. Paschos. 2. Randomized Complexity, Jeremy Barbay. Part 2: Classical Solution Methods 3. Branch-and-Bound, Irene Charon and Olivier Hudry. 4. Dynamic Programming, Bruno Escoffier and Olivier Spanjaard. Part 3: Elements from Mathematical Programming 5. Mixed Linear-Integer Programming Models for Combinatorial Optimization Problems, Federico Della Croce. 6. A Survey of some Linear Programming Methods, Pierre Tolla. 7. 0-1 Quadratic Optimization, Allain Billionnet. 8. Column Generation in Linear-Integer Programming, Irene Loiseau, Alberto Ceselli, Nelson Maculan and Matteo Salani. 9. Polyhedral Approaches, Ali Ridha Mahjoub. 10. Constraint Programming, Claude Le Pape. Top page

Add your comment

Add a review - Highlight this book to a friend

Please login or register to send your review

Top page
More books from the same department