Column Generation

[1]  Java Binding,et al.  GNU Linear Programming Kit , 2011 .

[2]  Guy Desaulniers,et al.  Multi-phase dynamic constraint aggregation for set partitioning type problems , 2010, Math. Program..

[3]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.

[4]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[5]  Jacques Desrosiers,et al.  On the choice of explicit stabilizing terms in column generation , 2007, Discret. Appl. Math..

[6]  Hanif D. Sherali,et al.  Complementary column generation and bounding approaches for set partitioning formulations , 2009, Optim. Lett..

[7]  Nikolaos Papadakos,et al.  Integrated airline scheduling , 2009, Comput. Oper. Res..

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

[9]  Artur Pessoa,et al.  Algorithms over Arc-time Indexed Formulations for Single and Parallel Machine Scheduling Problems , 2008 .

[10]  Michel Gendreau,et al.  Interior point stabilization for column generation , 2007, Oper. Res. Lett..

[11]  Walid Ben-Ameur,et al.  Acceleration of cutting‐plane and column generation algorithms: Applications to network design , 2007, Networks.

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

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

[14]  C. Lemaréchal,et al.  An inexact conic bundle variant suited to column generation , 2006 .

[15]  Giovanni Righini,et al.  A branch‐and‐price algorithm for the capacitated p‐median problem , 2005, Networks.

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

[17]  Guy Desaulniers,et al.  Dynamic Aggregation of Set-Partitioning Constraints in Column Generation , 2003, Oper. Res..

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

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

[20]  J. Desrosiers,et al.  A Primer in Column Generation , 2005 .

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

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

[23]  Francisco Barahona,et al.  On some difficult linear programs coming from set partitioning , 2002, Discret. Appl. Math..

[24]  J. V. D. de Carvalho.  A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems , 2002 .

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

[26]  Osman Ogtildeuz.  Generalized Column Generation for Linear Programming , 2002, Manag. Sci..

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

[28]  T. Ralphs,et al.  COIN/BCP User’s Manual , 2001 .

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

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

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

[32]  Stefan E. Karisch,et al.  A Framework for Constraint Programming Based Column Generation , 1999, CP.

[33]  Jørgen Tind,et al.  An interior point method in Dantzig-Wolfe decomposition , 1999, Comput. Oper. Res..

[34]  Matteo Fischetti,et al.  A Heuristic Method for the Set Covering Problem , 1999, Oper. Res..

[35]  Jacques Desrosiers,et al.  A Column Generation Approach for Large-Scale Aircrew Rostering Problems , 1999, Oper. Res..

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

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

[38]  Jean-François Cordeau,et al.  SIMULTANEOUS LOCOMOTIVE AND CAR ASSIGNMENT AT VIA RAIL CANADA , 1998 .

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

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

[41]  John J. H. Forrest,et al.  Column generation and the airline crew pairing problem. , 1998 .

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

[43]  Ellis L. Johnson,et al.  Solving Large Scale Crew Scheduling Problems , 1997 .

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

[45]  Dag Wedelin,et al.  An algorithm for large scale 0–1 integer programming with application to airline crew scheduling , 1995, Ann. Oper. Res..

[46]  M Marc Sol.  Column generation techniques for pickup and delivery problems , 1994 .

[47]  Donald Goldfarb,et al.  Steepest-edge simplex algorithms for linear programming , 1992, Math. Program..

[48]  Robert E. Bixby,et al.  Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods , 1992, Oper. Res..

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

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

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

[52]  A. A. Farley.  A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems , 1990, Oper. Res..

[53]  Harvey M. Salkin,et al.  A set-partitioning-based exact algorithm for the vehicle routing problem , 1989, Networks.

[54]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[55]  James K. Ho,et al.  Computational experience with advanced implementation of decomposition algorithms for linear programming , 1983, Math. Program..

[56]  Krzysztof C. Kiwiel,et al.  An aggregate subgradient method for nonsmooth convex minimization , 1983, Math. Program..

[57]  Donald Goldfarb,et al.  A practicable steepest-edge simplex algorithm , 1977, Math. Program..

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

[59]  Claude Lemaréchal,et al.  An Algorithm for Minimizing Convex Functions , 1974, IFIP Congress.

[60]  Paula M. J. Harris.  Pivot selection methods of the Devex LP code , 1973, Math. Program..

[61]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

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

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

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

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

[66]  A. A. Goldstein,et al.  Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.