The Aussois 2000 workshop in combinatorial optimization introduction Thomas M. LieblingDenis NaddefLaurence A. Wolsey Pages: 189 - 191
Integral decomposition of polyhedra and some applications in mixed integer programming Martin HenkMatthias KöppeRobert Weismantel Pages: 193 - 206
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming Egon BalasMichael Perregaard Pages: 221 - 245
Integer linear programming models for 2-staged two-dimensional Knapsack problems Andrea LodiMichele Monaci Pages: 257 - 278
On the separation of split cuts and related inequalities Alberto CapraraAdam N. Letchford Pages: 279 - 294
Preemptive scheduling with rejection Han HoogeveenMartin SkutellaGerhard J. Woeginger Pages: 361 - 374
On the polyhedral structure of a multi–item production planning model with setup times Andrew J. MillerGeorge L. NemhauserMartin W.P. Savelsbergh Pages: 375 - 405
Rectilinear group Steiner trees and applications in VLSI design Martin ZachariasenAndré Rohe Pages: 407 - 433
Optimal labeling of point features in rectangular labeling models Gunnar W. KlauPetra Mutzel Pages: 435 - 458
Easy and difficult objective functions for max cut S. Thomas McCormickM.R. RaoGiovanni Rinaldi Pages: 459 - 466