The State of the ArtBy
- E. Boros, Rutgers University, Center for Operations Research, Piscataway, NJ, USA
- P.L. Hammer, Rutgers University, Center for Operations Research, Piscataway, NJ, USA
One of the most frequently occurring types of optimization problems involves decision variables which have to take integer values. From a practical point of view, such problems occur in countless areas of management, engineering, administration, etc., and include such problems as location of plants or warehouses, scheduling of aircraft, cutting raw materials to prescribed dimensions, design of computer chips, increasing reliability or capacity of networks, etc. This is the class of problems known in the professional literature as "discrete optimization" problems. While these problems are of enormous applicability, they present many challenges from a computational point of view. This volume is an update on the impressive progress achieved by mathematicians, operations researchers, and computer scientists in solving discrete optimization problems of very large sizes. The surveys in this volume present a comprehensive overview of the state of the art in discrete optimization and are written by the most prominent researchers from all over the world.
This volume describes the tremendous progress in discrete optimization achieved in the last 20 years since the publication of Discrete Optimization '77, Annals of Discrete Mathematics, volumes 4 and 5, 1979 (Elsevier). It contains surveys of the state of the art written by the most prominent researchers in the field from all over the world, and covers topics like neighborhood search techniques, lift and project for mixed 0-1 programming, pseudo-Boolean optimization, scheduling and assignment problems, production planning, location, bin packing, cutting planes, vehicle routing, and applications to graph theory, mechanics, chip design, etc.
Key features:• state of the art surveys• comprehensiveness• prominent authors• theoretical, computational and applied aspects.This book is a reprint of Discrete Applied Mathematics Volume 23, Numbers 1-3
Researchers working in Operations Research, Mathematics, Computer Science Departments, Electrical, Economics, Industrial, Mechanical and Civil Engineering Departments.
Topics in Discrete Mathematics
Hardbound, 586 Pages
Published: March 2003
- Non-standard approaches to integer programming (K. Aardal, R. Weismantel, L.A. Wolsey).
A survey of very large-scale neighborhood search techniques (R.K. Ahuja, Ö. Ergun, J.B Orlin, A.P. Punnen).
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip (C. Albrecht, B. Korte, J. Schietke, J. Vygen).
Lift-and-project for Mixed 0-1 programming: recent progress (E. Balas, M. Perregaard).
Pseudo-Boolean optimization (E. Boros, P.L. Hammer).
Scheduling and constraint propagation (P. Brucker).
Selected topics on assignment problems (R.E. Burkard).
Ideal clutters (G. Cornuéjols, B. Guenin).
Production planning problems in printed circuit board assembly (Y. Crama, J. van de Klundert, F.C.R. Spieksma).
Discrete location problems with push-pull objectives (J. Krarup, D. Pisinger, F. Plastria).
Recent advances on two-dimensional bin packing problems (A. Lodi, S. Martello, D. Vigo).
Cutting planes in integer and mixed integer programming (H. Marchand, A. Martin, R. Weismantel, L. Wolsey).
Graph connectivity and its augmentation: applications of MA orderings (H. Nagamochi, T. Ibaraki).
Applications of combinatorics to statics - rigidity of grids (N. Radics, A. Recski).
Models, relaxations and exact approaches for the capacitated vehicle routing problem (P. Toth, D. Vigo).
Semidefinite programming for discrete optimization and matrix completion problems (H. Wolkowicz, M.F. Anjos).