Branch-and-price and multicommodity flows

Tese de doutoramento em Engenharia de Producao e Sistemas, area de Investigacao Operacional

[1]  Hossein Soroush,et al.  The stochastic multicommodity flow problem , 1990, Networks.

[2]  Claude Lemaréchal,et al.  The omnipresence of Lagrange , 2003, 4OR.

[3]  Paola Cappanera,et al.  Embedding a Bundle Method in a Branch and Bound Framework: an Application-Oriented Development , 2000 .

[4]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[5]  Warren B. Powell,et al.  A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem , 1999, Eur. J. Oper. Res..

[6]  M. P. Aragão,et al.  Integer Program Reformulation for Robust Branch-and-Cut-and-Price Algorithms , 2003 .

[7]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

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

[9]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

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

[11]  Giorgio Gallo,et al.  Shortest path algorithms , 1988, Handbook of Optimization in Telecommunications.

[12]  George L. Nemhauser,et al.  The fleet assignment problem: Solving a large-scale integer program , 1995, Math. Program..

[13]  Jeff L. Kennington,et al.  A Survey of Linear Cost Multicommodity Network Flows , 1978, Oper. Res..

[14]  Sven de Vries,et al.  A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions , 2005, Manag. Sci..

[15]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[16]  Celso C. Ribeiro,et al.  A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem , 1991, Oper. Res..

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

[18]  John W. Mamer,et al.  Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm , 2001, Networks.

[19]  Warren B. Powell,et al.  Multicommodity network flows: The impact of formulation on decomposition , 1993, Math. Program..

[20]  Giorgio Gallo,et al.  A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems , 1999, INFORMS J. Comput..

[21]  Paola Cappanera,et al.  Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems , 2003, INFORMS J. Comput..

[22]  Luiz Antonio Nogueira Lorena,et al.  A branch-and-price approach to p-median location problems , 2005, Comput. Oper. Res..

[23]  Teodor Gabriel Crainic,et al.  Bundle-based relaxation methods for multicommodity capacitated fixed charge network design , 2001, Discret. Appl. Math..

[24]  Jeffery L. Kennington,et al.  An Empirical Evaluation of the KORBX® Algorithms for Military Airlift Applications , 1990, Oper. Res..

[25]  Brigitte Jaumard,et al.  Erratum to "Comparison of column generation models for channel assignment in cellular networks" , 2002, Discret. Appl. Math..

[26]  R. Kipp Martin,et al.  Large scale linear and integer optimization - a unified approach , 1998 .

[27]  Taner Bilgiç,et al.  A column generation approach to the coalition formation problem in multi-agent systems , 2004, Comput. Oper. Res..

[28]  Horst W. Hamacher,et al.  Minimizing beam‐on time in cancer radiation treatment using multileaf collimators , 2004, Networks.

[29]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[30]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[31]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

[32]  Abdel Lisser,et al.  Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems , 2002, Oper. Res..

[33]  Richard D. McBride,et al.  Progress Made in Solving the Multicommodity Flow Problem , 1998, SIAM J. Optim..

[34]  Jan A. Persson,et al.  Shipment planning at oil refineries using column generation and valid inequalities , 2005, Eur. J. Oper. Res..

[35]  J. A. Tomlin,et al.  Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[36]  Michael A. Trick,et al.  Optimal shift scheduling: A branch-and-price approach , 2000 .

[37]  Zheng Wang,et al.  Explicit routing algorithms for Internet traffic engineering , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[38]  Kavindra Malik,et al.  Lotsizing and Scheduling in Parallel Machines with Sequence-Dependent Setup Costs , 1999 .

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

[40]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[41]  Michael A. Trick,et al.  Consolidating Maintenance Spares , 2001, Comput. Optim. Appl..

[42]  J. Shapiro.  A Survey of Lagrangian Techniques for Discrete Optimization. , 1979 .

[43]  Robert R. Meyer,et al.  An Interior Point Method for Block Angular Optimization , 1991, SIAM J. Optim..

[44]  James R. Evans.  Some Network Flow Models and Heuristics for Multiproduct Production and Inventory Planning , 1977 .

[45]  Mikael Rönnqvist,et al.  Scheduler – A System for Staff Planning , 2004, Ann. Oper. Res..

[46]  François Vanderbeck,et al.  Implementing Mixed Integer Column Generation , 2005 .

[47]  Mustafa Ç. Pinar,et al.  A data-level parallel linear-quadratic penalty algorithm for multicommodity network flows , 1994, TOMS.

[48]  Di Yuan,et al.  An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing , 2004, Comput. Optim. Appl..

[49]  Uwe T. Zimmermann,et al.  Engine Routing and Scheduling at Industrial In-Plant Railroads , 2003, Transp. Sci..

[50]  Michel Minoux,et al.  Mathematical Programming , 1986 .

[51]  Alberto Caprara,et al.  Sorting Permutations by Reversals Through Branch-and-Price , 2001, INFORMS J. Comput..

[52]  Martin W. P. Savelsbergh,et al.  Lifted Cover Inequalities for 0-1 Integer Programs: Complexity , 1999, INFORMS J. Comput..

[53]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[54]  Natashia Boland,et al.  A Column Generation Approach to Delivery Planning over Time with Inhomogeneous Service Providers and Service Interval Constraints , 2001, Ann. Oper. Res..

[55]  James B. Orlin,et al.  A Scaling Algorithm for Multicommodity Flow Problems , 2018, Oper. Res..

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

[57]  Lisa Fleischer,et al.  Approximating fractional multicommodity flow independent of the number of commodities , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[58]  Kjetil Fagerholt,et al.  Robust ship scheduling with multiple time windows , 2002 .

[59]  Michael A. Trick,et al.  Cliques and clustering: A combinatorial approach , 1998, Oper. Res. Lett..

[60]  J. Castro,et al.  An implementation of linear and nonlinear multicommodity network flows , 1996 .

[61]  M. J. Maher,et al.  Model Building in Mathematical Programming , 1978 .

[62]  G. Saviozzi.  Advanced start for the multicommodity network flow problem , 1986 .

[63]  Monique Guignard-Spielberg,et al.  Lagrangean decomposition: A model yielding stronger lagrangean bounds , 1987, Math. Program..

[64]  Miguel Constantino,et al.  A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints , 2005, Eur. J. Oper. Res..

[65]  Michael Jünger,et al.  The ABACUS system for branch‐and‐cut‐and‐price algorithms in integer programming and combinatorial optimization , 2000, Softw. Pract. Exp..

[66]  Clifford Stein,et al.  Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow , 1999, IPCO.

[67]  Stefan Thienel,et al.  ABACUS - a branch-and-CUt system , 1995 .

[68]  Jayaram K. Sankaran,et al.  Column generation applied to linear programs in course registration , 1995 .

[69]  S. Yan,et al.  Optimal construction of airline individual crew pairings , 2002, Comput. Oper. Res..

[70]  George L. Nemhauser,et al.  The Age of Optimization: Solving Large-Scale Real-World Problems , 1994, Oper. Res..

[71]  Pravin M. Vaidya,et al.  Speeding up Karmarkar's algorithm for multicommodity flows , 1996, Math. Program..

[72]  Barry Richards,et al.  A hybrid multicommodity routing algorithm for traffic engineering , 2004, Networks.

[73]  Shangyao Yan,et al.  Airline cockpit crew scheduling , 2002, Eur. J. Oper. Res..

[74]  Jacques Desrosiers,et al.  Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems , 2002 .

[75]  Steven E. Butt,et al.  An optimal solution procedure for the multiple tour maximum collection problem using column generation , 1999, Comput. Oper. Res..

[76]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[77]  Nina K. Detlefsen,et al.  The simplex algorithm for multicommodity networks , 2002, Networks.

[78]  Antonio Frangioni,et al.  Generalized Bundle Methods , 2002, SIAM J. Optim..

[79]  Mikael Rönnqvist,et al.  Supply chain optimization in the pulp mill industry--IP models, column generation and novel constraint branches , 2004, Eur. J. Oper. Res..

[80]  Brigitte Jaumard,et al.  A generalized linear programming model for nurse scheduling , 1996, Eur. J. Oper. Res..

[81]  J. M. Valério de Carvalho,et al.  Comparing Branch-and-price Algorithms for the Unsplittable Multicommodity Flow Problem , 2003 .

[82]  J. Goffin,et al.  Decomposition and nondifferentiable optimization with the projective algorithm , 1992 .

[83]  Annegret Liebers,et al.  Journal of Graph Algorithms and Applications Planarizing Graphs — a Survey and Annotated Bibliography , 2022 .

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

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

[86]  Jacques Desrosiers,et al.  Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems , 1998, Transp. Sci..

[87]  José M. Valério de Carvalho,et al.  Using Extra Dual Cuts to Accelerate Column Generation , 2005, INFORMS J. Comput..

[88]  Mikael Rönnqvist,et al.  Ring Network Design by Lagrangean Based Column Generation , 2002, Telecommun. Syst..

[89]  John W. Mamer,et al.  Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm , 1997, INFORMS J. Comput..

[90]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

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

[92]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[93]  Marielle Christiansen,et al.  Modelling path flows for a combined ship routingand inventory management problem , 1998, Ann. Oper. Res..

[94]  Brigitte Jaumard,et al.  Comparison of column generation models for channel assignment in cellular networks , 2001, Discret. Appl. Math..

[95]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[96]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[97]  Sungsoo Park,et al.  An Integer Programming Approach to the Bandwidth Packing Problem , 1996 .

[98]  Jesper Larsen,et al.  Lagrangean duality applied on vehicle routing with time windows , 2001 .

[99]  R. V. Helgason,et al.  Algorithms for network programming , 1980 .

[100]  Stefan E. Karisch,et al.  Constraint Programming Based Column Generation for Crew Assignment , 2002, J. Heuristics.

[101]  Martin W. P. Savelsbergh,et al.  Lifted Cover Inequalities for 0-1 Integer Programs: Computation , 1998, INFORMS J. Comput..

[102]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[103]  Antonio Frangioni,et al.  About Lagrangian Methods in Integer Optimization , 2005, Ann. Oper. Res..

[104]  J. B. Rosen.  Primal partition programming for block diagonal matrices , 1964 .

[105]  Karla L. Homan.  Combinatorial optimization: Current successes and directions for the future , 2000 .

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

[107]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[108]  Pamela H. Vance,et al.  Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..

[109]  M. Wagner,et al.  Generalized Linear Programming Solves the Dual , 1976 .

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

[111]  Guy Desaulniers,et al.  Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..

[112]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[113]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[114]  Warren B. Powell,et al.  A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem , 1993, Oper. Res..

[115]  Laurence A. Wolsey,et al.  Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms , 1998, Oper. Res..

[116]  Jordi Castro,et al.  A Specialized Interior-Point Algorithm for Multicommodity Network Flows , 1999, SIAM J. Optim..

[117]  Anthony J. Zahorik,et al.  Network Programming Models for Production Scheduling in Multi-Stage, Multi-Item Capacitated Systems , 1984 .

[118]  B. Rothschild,et al.  MULTICOMMODITY NETWORK FLOWS. , 1969 .

[119]  C. Ribeiro,et al.  An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment , 1989 .

[120]  Samir Elhedhli,et al.  The integration of an interior-point cutting plane method within a branch-and-price algorithm , 2004, Math. Program..

[121]  François Vanderbeck,et al.  Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..

[122]  Sungsoo Park,et al.  An Integer Programming Approach to the Path Selection Problems , 2003 .

[123]  Tony J. Van Roy,et al.  A Cross Decomposition Algorithm for Capacitated Facility Location , 1986, Oper. Res..

[124]  W. Wilhelm.  A Technical Review of Column Generation in Integer Programming , 2001 .

[125]  François Soumis,et al.  Decomposition and Column Generation , 1997 .

[126]  A. K. Aggarwal,et al.  A heuristic solution procedure for multicommodity integer flows , 1995, Comput. Oper. Res..

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

[128]  Laurence A. Wolsey,et al.  Non-standard approaches to integer programming , 2002, Discret. Appl. Math..

[129]  Alain Hertz,et al.  Bounds and Heuristics for the Shortest Capacitated Paths Problem , 2002, J. Heuristics.

[130]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[131]  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..

[132]  Z. Degraeve,et al.  Improved Lower Bounds for the Capacitated Lot Sizing Problem with Set Up Times , 2003 .

[133]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[134]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

[135]  Laurence A. Wolsey,et al.  Cutting planes in integer and mixed integer programming , 2002, Discret. Appl. Math..

[136]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[137]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

[138]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[139]  George L. Nemhauser,et al.  Airline Crew Scheduling: A New Formulation and Decomposition Algorithm , 1997, Oper. Res..

[140]  Wilbert E. Wilhelm,et al.  A Column-Generation Approach for the Assembly System Design Problem with Tool Changes , 1999 .

[141]  Nelson Maculan,et al.  The volume algorithm revisited: relation with bundle methods , 2002, Math. Program..

[142]  J. Goffin,et al.  Using central prices in the decomposition of linear programs , 1990 .

[143]  Antonio Frangioni,et al.  Computational Experience with a Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows , 1999, System Modelling and Optimization.

[144]  Deep Medhi,et al.  Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs , 1994, Math. Program..

[145]  G. Righini,et al.  A branch-and-price algorithm for the capacitated p-median problem , 2005 .

[146]  Dennis Huisman,et al.  Models and Algorithms for Integration of Vehicle and Crew Scheduling , 2000, J. Sched..

[147]  Bala Shetty,et al.  A Parallel Projection for the Multicommodity Network Model , 1990 .

[148]  Abdel Lisser,et al.  Minimum-Cost Multicommodity Flow , 2002 .

[149]  David Grove Jørgensen,et al.  A branch-and-price algorithm for switch-box routing , 2002, Networks.

[150]  Dong X. Shaw.  A unified limited column generation approach for facility location problems ontrees , 1999, Ann. Oper. Res..

[151]  Paul Wentges.  Weighted Dantzig-Wolfe decomposition for linear mixed-integer programming , 1997 .

[152]  Cynthia Barnhart,et al.  A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems , 1993, Transp. Sci..

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

[154]  Cynthia Barnhart,et al.  Air Network Design for Express Shipment Service , 1996, Oper. Res..

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

[156]  Yurii Nesterov,et al.  New variants of bundle methods , 1995, Math. Program..

[157]  Laurence A. Wolsey,et al.  An exact algorithm for IP column generation , 1994, Oper. Res. Lett..

[158]  Jonathan F. Bard,et al.  Preference scheduling for nurses using column generation , 2005, Eur. J. Oper. Res..

[159]  José M. Valério de Carvalho,et al.  Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..

[160]  J. Mamer,et al.  A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem , 2000 .

[161]  Gilbert Laporte,et al.  A combinatorial column generation algorithm for the maximum stable set problem , 1997, Oper. Res. Lett..

[162]  C. Lemaréchal.  Nondifferentiable optimization , 1989 .

[163]  Philippe Mahey,et al.  A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .

[164]  Jacques Desrosiers,et al.  Dual-Optimal Inequalities for Stabilized Column Generation , 2003, Oper. Res..

[165]  Laurence A. Wolsey,et al.  Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation , 2002, Manag. Sci..

[166]  Jacques Desrosiers,et al.  OPERATIONAL CAR ASSIGNMENT AT VIA RAIL CANADA , 2000 .

[167]  Teodor Gabriel Crainic,et al.  Multicommodity Capacitated Network Design , 1999 .

[168]  Jean-Philippe Vial,et al.  Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method , 2002, Optim. Methods Softw..

[169]  Sungsoo Park,et al.  An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links , 2001, Eur. J. Oper. Res..

[170]  Jacques Desrosiers,et al.  On Compact Formulations for Integer Programs Solved by Column Generation , 2005, Ann. Oper. Res..

[171]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[172]  J. Kennington,et al.  An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems , 1977 .

[173]  Subhash C. Sarin,et al.  Modeling and algorithmic development of a staff scheduling problem , 2001, Eur. J. Oper. Res..

[174]  Di Yuan,et al.  A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation , 2003, INFORMS J. Comput..

[175]  Andrew V. Goldberg,et al.  An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow , 1998, IPCO.

[176]  Torbjörn Larsson,et al.  A column generation procedure for the side constrained traffic equilibrium problem , 2004 .

[177]  Jennifer Ryan,et al.  A column generation algorithm for bandwidth packing , 1993, Telecommun. Syst..