Decomposition methods for integer linear programming

1

[1]  M. Saltzman,et al.  ALPS : A Framework for Implementing Parallel Search Algorithms , 2004 .

[2]  Jacek Gondzio,et al.  Column Generation With a Primal-Dual Method , 1996 .

[3]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[4]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[5]  Stephen J. Wright,et al.  Warm-Start Strategies in Interior-Point Methods for Linear Programming , 2002, SIAM J. Optim..

[6]  Martin Grötschel,et al.  On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..

[7]  Lei Chen,et al.  Building an Adaptive Multimedia System using the Utility Model , 1999, IPPS/SPDP Workshops.

[8]  William J. Cook,et al.  Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems , 2003, Math. Program..

[9]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[10]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[11]  Robert E. Bixby,et al.  Solving Real-World Linear Programs: A Decade and More of Progress , 2002, Oper. Res..

[12]  G. Nemhauser,et al.  Integer Programming , 2020 .

[13]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

[14]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[15]  Francisco Barahona,et al.  Plant location with minimum inventory , 1998, Math. Program..

[16]  Ted K. Ralphs,et al.  Parallel branch and cut for vehicle routing , 1995 .

[17]  E. Balas,et al.  Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework , 1996 .

[18]  Jeff T. Linderoth,et al.  Orbital branching , 2007, Math. Program..

[19]  M. Guignard.  Lagrangean relaxation , 2003 .

[20]  Monique Guignard-Spielberg.  Efficient cuts in Lagrangean 'Relax-and-cut' schemes , 1998, Eur. J. Oper. Res..

[21]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[22]  Ted K. Ralphs,et al.  Decomposition and Dynamic Cut Generation in Integer Linear Programming , 2006, Math. Program..

[23]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[24]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[25]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

[26]  Toshihide Ibaraki,et al.  Implementing an efficient minimum capacity cut algorithm , 1994, Math. Program..

[27]  David Pisinger.  A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .

[28]  Robin Lougee,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003, IBM J. Res. Dev..

[29]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[30]  Robert E. Bixby,et al.  Progress in computational mixed integer programming—A look back from the other side of the tipping point , 2007, Ann. Oper. Res..

[31]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[32]  S. Martello,et al.  Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .

[33]  François Vanderbeck,et al.  Branching in branch-and-price: a generic scheme , 2011, Math. Program..

[34]  M. Saltzman,et al.  Alps: A Framework for Implementing Parallel Tree Search Algorithms , 2005 .

[35]  Abilio Lucena,et al.  Stronger K-tree relaxations for the vehicle routing problem , 2004, Eur. J. Oper. Res..

[36]  Michael Jünger,et al.  Introduction to ABACUS - a branch-and-cut system , 1998, Oper. Res. Lett..

[37]  Jacques Desrosiers,et al.  2-Path Cuts for the Vehicle Routing Problem with Time Windows , 1997, Transp. Sci..

[38]  Abilio Lucena.  Non Delayed Relax-and-Cut Algorithms , 2005, Ann. Oper. Res..

[39]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[40]  Defeng Sun,et al.  Polyhedral Methods for Solving Three Index Assignment Problems , 2000 .

[41]  Martin Grötschel,et al.  On the symmetric travelling salesman problem I: Inequalities , 1979, Math. Program..

[42]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[43]  Donald L. Miller.  A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems , 1995, INFORMS J. Comput..

[44]  George L. Nemhauser,et al.  Lifted cover facets of the 0-1 knapsack polytope with GUB constraints , 1994, Oper. Res. Lett..

[45]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[46]  Nicolas Jozefowiez,et al.  The vehicle routing problem: Latest advances and new challenges , 2007 .

[47]  Maddalena Nonato,et al.  Applying Bundle Methods to the Optimization of Polyhedral Functions: An Applications-Oriented Development , 1995 .

[48]  Alexander Schwartz,et al.  Implementing weighted b-matching algorithms: towards a flexible software design , 1999, JEAL.

[49]  Claude Lemaréchal,et al.  Comparison of bundle and classical column generation , 2008, Math. Program..

[50]  Jorge J. Moré,et al.  Benchmarking optimization software with performance profiles , 2001, Math. Program..

[51]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[52]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

[53]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[54]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[55]  Alexander Martin.  Integer Programs with Block Structure , 1999 .

[56]  Jeff Linderoth,et al.  Topics in parallel integer optimization , 1998 .

[57]  Martin W. P. Savelsbergh,et al.  MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..

[58]  Giovanni Rinaldi,et al.  Branch-And-Cut Algorithms for the Capacitated VRP , 2001, The Vehicle Routing Problem.

[59]  Jorge J. Moré,et al.  The NEOS Server , 1998 .

[60]  L. Trotter,et al.  A new generic separation routine and its application in a branch and cut algorithm for the capacitated vehicle routing problem , 1999 .

[61]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[62]  Carlos Eduardo Ferreira,et al.  Matrix Decomposition by Branch-and-Cut , 1997 .

[63]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[64]  Robert E. Bixby,et al.  MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

[65]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[66]  Pamela H. Vance,et al.  Knapsack Problems: Algorithms and Computer Implementations (S. Martello and P. Toth) , 1993, SIAM Rev..

[67]  Laurence A. Wolsey,et al.  bc–opt: a branch-and-cut code for mixed integer programs , 1999, Math. Program..

[68]  Terry P. Harrison,et al.  Lot-Sizing with Start-Up Times , 1998 .

[69]  Francisco Barahona,et al.  The volume algorithm: producing primal solutions with a subgradient method , 2000, Math. Program..

[70]  Ted K. Ralphs.  The SYMPHONY Callable Library for Mixed-Integer Linear Programming , 2005 .

[71]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics) , 2007 .

[72]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[73]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[74]  R. Lougee-Heimer,et al.  The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community , 2003 .

[75]  Leslie E. Trotter,et al.  On the capacitated vehicle routing problem , 2003, Math. Program..