Robust discrete optimization and network flows Dimitris BertsimasMelvyn Sim OriginalPaper 07 May 2003 Pages: 49 - 71
Tight formulations for some simple mixed integer programs and convex objective integer programs Andrew J. MillerLaurence A. Wolsey OriginalPaper 10 April 2003 Pages: 73 - 88
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms J.-P.P. RichardI.R. de Farias JrG.L. Nemhauser OriginalPaper 07 May 2003 Pages: 89 - 113
Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting J.-P.P. RichardI.R. de Farias JrG.L. Nemhauser OriginalPaper 07 May 2003 Pages: 115 - 143
On the facets of the mixed–integer knapsack polyhedron Alper Atamtürk OriginalPaper 10 April 2003 Pages: 145 - 175
Facets of the independent set polytope Todd EastonKevin HookerEva K. Lee OriginalPaper 07 May 2003 Pages: 177 - 199
Binary clutter inequalities for integer programs Adam N. Letchford OriginalPaper 28 March 2003 Pages: 201 - 221
The domino inequalities: facets for the symmetric traveling salesman polytope Denis NaddefEmmanuel Wild OriginalPaper 10 April 2003 Pages: 223 - 251
Parallel branch, cut, and price for large-scale discrete optimization T.K. RalphsL. LadányiM.J. Saltzman OriginalPaper 10 April 2003 Pages: 253 - 280
An algorithm for mixed integer optimization Matthias KöppeRobert Weismantel OriginalPaper 28 March 2003 Pages: 281 - 307
The stable set problem and the lift-and-project ranks of graphs László LiptákLevent Tunçel OriginalPaper 10 April 2003 Pages: 319 - 353
Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices Endre BorosKhaled ElbassioniLeonid Khachiyan OriginalPaper 10 April 2003 Pages: 355 - 368
Detecting symmetries by branch & cut Christoph BuchheimMichael Jünger OriginalPaper 07 May 2003 Pages: 369 - 384
The clustering matroid and the optimal clustering tree Ephraim KorachMichal Stern OriginalPaper 10 April 2003 Pages: 385 - 414
Max algebra and the linear assignment problem Rainer E. BurkardPeter Butkovič OriginalPaper 28 March 2003 Pages: 415 - 429
Models and algorithms for a staff scheduling problem Alberto CapraraMichele MonaciPaolo Toth OriginalPaper 10 April 2003 Pages: 445 - 476
Approximation algorithms for the test cover problem K.M.J. De BontridderB.V. HalldórssonL. Stougie OriginalPaper 07 May 2003 Pages: 477 - 491
The design of corporate tax structures Simon ChristofidesAlexander ChristofidesNicos Christofides OriginalPaper 10 April 2003 Pages: 493 - 510