Combinatorial Optimization: Methods and Applications
β Scribed by V. Chvatal
- Publisher
- IOS Press
- Year
- 2011
- Tongue
- English
- Leaves
- 240
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
This book is a collection of six articles arising from the meeting of the NATO Advanced Study Institute (ASI) Combinatorial Optimization: Methods and Applications, which was held at the University of Montreal in June 2006. This ASI consisted of seven series of five one-hour lectures and one series of four one-hour lectures. It was attended by some sixty students of graduate or postdoctoral level from fifteen countries worldwide. Topics include: integer and mixed integer programming, facility location, branching on split disjunctions, convexity in combinatorial optimization, and VLSI design. Although drawn from the 2006 lecture series, the articles included in this volume were all either written or updated by the authors in 2010, so that this collection of papers reflects a state-of-the-art overview of combinatorial optimization methods and their applications.
β¦ Table of Contents
Title......Page 1
Preface......Page 5
Acknowledgments......Page 7
The NATO Advanced Study Institute......Page 9
Contents......Page 11
Mixed Integer Rounding Cuts and Master Group Polyhedra......Page 13
Combinatorial Optimization in VLSI Design......Page 45
Facility Location: Discrete Models and Local Search Methods......Page 109
Discrete Convexity and Its Applications......Page 147
Branching on Split Disjunctions......Page 176
Convex Discrete Optimization......Page 195
β¦ Subjects
ΠΠ°ΡΠ΅ΠΌΠ°ΡΠΈΠΊΠ°;ΠΠ΅ΡΠΎΠ΄Ρ ΠΎΠΏΡΠΈΠΌΠΈΠ·Π°ΡΠΈΠΈ;
π SIMILAR VOLUMES
This book constitutes the refereed proceedings of the First International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August 2007. The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewe
This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by
<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This