default search action
Discrete Applied Mathematics, Volume 123
Volume 123, Number 1-3, November 2002
- Karen I. Aardal, Robert Weismantel, Laurence A. Wolsey:
Non-standard approaches to integer programming. 5-74 - Ravindra K. Ahuja, Özlem Ergun, James B. Orlin, Abraham P. Punnen:
A survey of very large-scale neighborhood search techniques. 75-102 - Christoph Albrecht, Bernhard Korte, Jürgen Schietke, Jens Vygen:
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip. 103-127 - Egon Balas, Michael Perregaard:
Lift-and-project for Mixed 0-1 programming: recent progress. 129-154 - Endre Boros, Peter L. Hammer:
Pseudo-Boolean optimization. 155-225 - Peter Brucker:
Scheduling and constraint propagation. 227-256 - Rainer E. Burkard:
Selected topics on assignment problems. 257-302 - Gérard Cornuéjols, Bertrand Guenin:
Ideal clutters. 303-338 - Yves Crama, Joris van de Klundert, Frits C. R. Spieksma:
Production planning problems in printed circuit board assembly. 339-361 - Jakob Krarup, David Pisinger, Frank Plastria:
Discrete location problems with push-pull objectives. 363-378 - Andrea Lodi, Silvano Martello, Daniele Vigo:
Recent advances on two-dimensional bin packing problems. 379-396 - Hugues Marchand, Alexander Martin, Robert Weismantel, Laurence A. Wolsey:
Cutting planes in integer and mixed integer programming. 397-446 - Hiroshi Nagamochi, Toshihide Ibaraki:
Graph connectivity and its augmentation: applications of MA orderings. 447-472 - Norbert Radics, András Recski:
Applications of combinatorics to statics--rigidity of grid. 473-485 - Paolo Toth, Daniele Vigo:
Models, relaxations and exact approaches for the capacitated vehicle routing problem. 487-512 - Henry Wolkowicz, Miguel F. Anjos:
Semidefinite programming for discrete optimization and matrix completion problems. 513-577
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.