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
Combinatorial Optimization: New Frontiers in Theory and Practice
✍ Scribed by Olaf E. Flippo, Alexander H. G. Rinnooy Kan (auth.), Mustafa Akgül, Horst W. Hamacher, Süleyman Tüfekçi (eds.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 1992
- Tongue
- English
- Leaves
- 335
- Series
- NATO ASI Series 82
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
✦ Synopsis
There have been significant developments in the theory and practice of combinatorial optimization in the last 15 years. This progress has been evidenced by a continuously increasing number of international and local conferences, books and papers in this area. This book is also another contribution to this burgeoning area of operations research and optimization. This volume contains the contributions of the participants of the recent NATO Ad vanced Study Institute, New Frontiers in the Theory and Practice of Combinatorial Op timization, which was held at the campus of Bilkent University, in Ankara, Turkey, July 16-29, 1990. In this conference, we brought many prominent researchers and young and promising scientists together to discuss current and future trends in the theory and prac tice of combinatorial optimization. The Bilkent campus was an excellent environment for such an undertaking. Being outside of Ankara, the capital of Turkey, Bilkent University gave the participants a great opportunity for exchanging ideas and discussing new theories and applications without much distraction. One of the primary goals of NATO ASIs is to bring together a group of scientists and research scientists primarily from the NATO countries for the dissemination of ad vanced scientific knowledge and the promotion of international contacts among scientists. We believe that we accomplished this mission very successfully by bringing together 15 prominent lecturers and 45 promising young scientists from 12 countries, in a university environment for 14 days of intense lectures, presentations and discussions.
✦ Table of Contents
Front Matter....Pages I-XI
Variable Decomposition, Constraint Decomposition and Cross Decomposition in General Mathematical Programming....Pages 1-18
Surrogate Constraint Methods for Linear Inequalities....Pages 19-38
An Evaluation of Algorithmic Refinements and Proper Data Structures for the Preflow-Push Approach for Maximum Flow....Pages 39-62
A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times....Pages 63-83
The Linear Assignment Problem....Pages 85-122
Cost Allocation In The Oil Industry: An Example....Pages 123-132
On Preference Orders for Sequencing Problems Or, What Hath Smith Wrought?....Pages 133-159
Dynamic Basis Partitioning for Network Flows with Side Constraints....Pages 161-185
Combinatorial Optimization Models Motivated by Robotic Assembly Problems....Pages 187-198
Job Shop Scheduling....Pages 199-207
On the Construction of the Set of K-best Matchings and Their Use in Solving Constrained Matching Problems....Pages 209-223
Solving Large Scale Multicommodity Networks Using Linear—Quadratic Penalty Functions....Pages 225-230
An Analysis of the Minimal Spanning Tree Structure....Pages 231-234
Genetic Algorithms: A New Approach to the Timetable Problem....Pages 235-239
A New Approximation Technique for Hypergraph Partitioning Problem....Pages 241-244
Optimal Location of Concentrators in a Centralized Teleprocessing Network....Pages 245-248
A Column Generation Algorithm for the Vehicle Routing Problem with Time Windows....Pages 249-252
The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method....Pages 253-257
A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints....Pages 259-261
On Pleasant Knapsack Problems....Pages 263-268
Extensions of Efficient Exact Solution Procedures to Bicriterion Optimization....Pages 269-270
Combinatorial Aspects in Single Junction Control Optimization....Pages 271-273
Approximation Algorithms for Constrained Scheduling....Pages 275-278
An Analogue of Hoffman’s Circulation Conditions for Max-Balanced Flows....Pages 279-281
Some Telecommunications Network Design Problems and the Bi-Steiner Problem....Pages 283-286
Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs....Pages 287-289
Exact Solution of Multiple Traveling Salesman Problems....Pages 291-292
A Nonlinear Two-Stage Cutting Stock Problem....Pages 293-294
The Probabilistic Behavior of the Generalized HARMONIC Algorithm for the On-Line Multi-Dimensional Bin Packing....Pages 295-297
Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem....Pages 299-301
A Phase I That Solves Transportation Problems....Pages 303-306
A Polynomially Bounded Dual Simplex Algorithm for Capacitated Minimum Cost Flow Problem....Pages 307-308
Formulation and a Lagrangean Relaxation Procedure for Solving Part Scheduling and Tool Loading Problems in FMS....Pages 309-312
Euclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs....Pages 313-316
A Set Covering Formulation of the Matrix Equipartition Problem....Pages 317-319
Maximizing a Submodular Function by Integer Programming: A Polyhedral Approach....Pages 321-322
New Bounds for the Asymmetric Traveling Salesman Problem....Pages 323-324
A Lagrangean Heuristic for Set Covering Problems....Pages 325-326
Back Matter....Pages 327-338
✦ Subjects
Algorithm Analysis and Problem Complexity; Combinatorics; Numerical Analysis; Economic Theory; Systems Theory, Control; Calculus of Variations and Optimal Control; Optimization
📜 SIMILAR VOLUMES
<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
This monograph provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization. The questions that receive the most attention are those that deal with discrete optimization problems for points in Euclidean space, such as the m
This monograph provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization. The questions that receive the most attention are those that deal with discrete optimization problems for points in Euclidean space, such as the m
My special field is neither statistics nor math. My reading this book was for research purpose. I enjoyed reading it, though it contains a few of "printing" mistakes. <p>The chapter 6 is somehow hard-to-find. I believe Talagrand's isoperimetric theory has wide range of applications. But it is not