跳到主要內容

Concepts of Combinatorial Optimization

$5561元 定價: $6179 9折 可訂購

也可以到門市自行翻閱這本書

店內位置

下單選門市自取可使用文化幣
有團購需求請加官方LINE詢問

LINE US!
直接購買
作者
Vangelis Th. Paschos
出版社
John Wiley
ISBN
9781848216563
出版日期
2014/09

簡介

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 aim 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, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

目錄

Preface xiii Vangelis Th. Paschos Part I Complexity of Combinatioral Optimization Problems 1 Chapter 1 Basic Concepts in Algorithms and Complexity Theory 3 Vangelis Th. Paschos Chapter 2 Randomized Complexity 21 Jérémy Barbay Part II Classic Solution Methods 39 Chapter 3 Branch-and-Bound Methods 41 Irène Charon and Olivier Hudry Chapter 4 Dynamic Programming 71 Bruno Escoffier and Olivier Spanjaard Part III Elements from Mathematical Programming 101 Chapter 5 Mixed Integer Linear Programming Models for Combinatorial Optimization Problems 103 Frédérico Della Croce Chapter 6 Simplex Algorithms for Linear Programming 135 Frédérico Della Croce and Andrea Grosso Chapter 7 A Survey of Some Linear Programming Methods 157 Pierre Tolla Chapter 8 Quadratic Optimization in 0-1 Variables 189 Alain Billionnet Chapter 9 Column Generation in Integar Linear Programming 235 Irène Loiseau, Alberto Ceselli, Nelson Maculan and Matteo Salani Chapter 10 Polyhedral Approaches 261 Ali Ridha Mahjoub Chapter 11 Constaint Programming 325 Claude Le Pape General Bibliography 339 List of Authors 363 Index 367 Summary of Other Volumes in the Series 371

為您推薦