Separation of Generic Cutting Planes in Branch-and-Price Using a Basis
暂无分享,去创建一个
[1] Gerhard Wäscher,et al. Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .
[2] Tobias Achterberg,et al. Constraint integer programming , 2007 .
[3] Arthur M. Geoffrion,et al. Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.
[4] Domenico Salvagnin,et al. The strength of multi-row models , 2015, Math. Program. Comput..
[5] Martin W. P. Savelsbergh,et al. A generic view of Dantzig-Wolfe decomposition in mixed integer programming , 2006, Oper. Res. Lett..
[6] Joseph L. Rios,et al. Converging upon basic feasible solutions through Dantzig–Wolfe decomposition , 2014, Optim. Lett..
[7] Alberto Ceselli,et al. Automatic Dantzig–Wolfe reformulation of mixed integer programs , 2014, Mathematical Programming.
[8] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[9] Stefan Irnich,et al. Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem , 2012, Oper. Res..
[10] Matthew Galati,et al. Decomposition methods for integer linear programming , 2010 .
[11] Ted K. Ralphs,et al. Decomposition and Dynamic Cut Generation in Integer Linear Programming , 2006, Math. Program..
[12] Alberto Caprara,et al. Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem , 2013, INFORMS J. Comput..
[13] John E. Beasley,et al. A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..
[14] Egon Balas,et al. Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..
[15] Louis Anthony Cox,et al. Wiley encyclopedia of operations research and management science , 2011 .
[16] Gerald Gamrath,et al. Generic Branch-Cut-and-Price , 2010 .
[17] 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..
[18] Ted K. Ralphs,et al. Integer and Combinatorial Optimization , 2013 .
[19] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[20] D. Griffel. Linear programming 2: Theory and extensions , by G. B. Dantzig and M. N. Thapa. Pp. 408. £50.00. 2003 ISBN 0 387 00834 9 (Springer). , 2004, The Mathematical Gazette.
[21] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[22] Marco E. Lübbecke,et al. Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs , 2010, SEA.
[23] Sanjeeb Dash,et al. A heuristic to generate rank-1 GMI cuts , 2010, Math. Program. Comput..
[24] Rashed Sahraeian. Solving Capacitated P-Median Problem by Hybrid K-Means Clustering and Fixed Neighborhood Search algorithm , 2010 .
[25] A. S. Goncalves. Basic Feasible Solutions and the Dantzig-Wolfe Decomposition Algorithm , 1968 .
[26] Jacques Desrosiers,et al. Cutting planes for branch‐and‐price algorithms , 2009, Networks.
[27] Gerhard Wäscher,et al. CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem , 1995 .
[28] Dirk Cattrysse,et al. A set partitioning heuristic for the generalized assignment problem , 1994 .
[29] Matteo Fischetti,et al. Optimizing over the first Chvátal closure , 2005, Math. Program..
[30] Stefan Irnich,et al. Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling , 2010, INFORMS J. Comput..
[31] Hayat Abdullah Shamakhai. The 0 -1 multiple knapsack problem , 2017 .
[32] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.
[33] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[34] H. Tempelmeier,et al. A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times , 1996 .
[35] M. R. Rao,et al. Combinatorial Optimization , 1992, NATO ASI Series.
[36] Jacques Desrosiers,et al. Selected Topics in Column Generation , 2002, Oper. Res..
[37] J. Desrosiers,et al. A Primer in Column Generation , 2005 .
[38] Gleb Belov,et al. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..
[39] Jacques Desrosiers,et al. Recovering an optimal LP basis from an optimal dual solution , 2006, Oper. Res. Lett..
[40] Ibrahim H. Osman,et al. Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches , 1995 .
[41] J. Desrosiers,et al. BRANCH-PRICE-AND-CUT ALGORITHMS , 2011 .
[42] Friedrich Eisenbrand,et al. NOTE – On the Membership Problem for the Elementary Closure of a Polyhedron , 1999, Comb..
[43] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[44] M. E. Galassi,et al. GNU SCIENTI C LIBRARY REFERENCE MANUAL , 2005 .
[45] Gerhard Wäscher,et al. The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .
[46] Guy Desaulniers,et al. Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows , 2010, INFOR Inf. Syst. Oper. Res..
[47] Robert E. Bixby,et al. Recovering an optimal LP basis from an interior point solution , 1994, Oper. Res. Lett..
[48] Peter J. Stuckey,et al. Dantzig-Wolfe decomposition and branch-and-price solving in G12 , 2009, Constraints.
[49] Alberto Caprara,et al. Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation , 2011, IPCO.
[50] Troels Martin Range. An Integer Cutting-Plane Procedure for the Dantzig-Wolfe Decomposition: Theory , 2006 .