Discrete Optimization

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).< BR>
Maximum mean weight cycle in a digraph and minimizing cyc le time of a logic chip (C. Albrecht, B. Korte, J. Schietke, J. Vygen).< BR>
Lift-and-project for Mixed 0-1 programming: recent progre ss (E. Balas, M. Perregaard).

Pseudo-Boolean optimization (E. Boros, P.L. Hammer).

Scheduling and constraint propa gation (P. Brucker).

Selected topics on assignment proble ms (R.E. Burkard).

Ideal clutters (G. Cornuéjols, B. Guenin).

Production planning problems in printed circu it board assembly (Y. Crama, J. van de Klundert, F.C.R. Spieksma).
Discrete location problems with push-pull objectives (J. Kraru p, D. Pisinger, F. Plastria).

Recent advances on two-dime nsional bin packing problems (A. Lodi, S. Martello, D. Vigo).

Cutting planes in integer and mixed integer programming (H. Marchan 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: o state of the art surveys o comprehensiveness o prominent authors o theoretical, computational and applied aspects. This book is a reprint of Discrete Applied Mathematics Volume 23, Numbers 1-3