Combinatorial Benders' Cuts for the Strip Packing Problem
暂无分享,去创建一个
[1] Gleb Belov,et al. Packing of one-dimensional bins with contiguous selection of identical items: An exact method of optimal solution , 2011 .
[2] A. M. Geoffrion. Generalized Benders decomposition , 1972 .
[3] J. C. Herz,et al. Recursive computational procedure for two-dimensional stock cutting , 1972 .
[4] John N. Hooker,et al. Planning and Scheduling by Logic-Based Benders Decomposition , 2007, Oper. Res..
[5] Stéphane Grandcolas,et al. A SAT Encoding for Multi-dimensional Packing Problems , 2010, CPAIOR.
[6] Klaus Jansen,et al. Rectangle packing with one-dimensional resource augmentation , 2009, Discret. Optim..
[7] Daniele Vigo,et al. An Exact Approach to the Strip-Packing Problem , 2003, INFORMS J. Comput..
[8] J. O. Berkey,et al. Two-Dimensional Finite Bin-Packing Algorithms , 1987 .
[9] Hiroshi Nagamochi,et al. Exact algorithms for the two-dimensional strip packing problem with and without rotations , 2009, Eur. J. Oper. Res..
[10] John Augustine,et al. Strip packing with precedence constraints and strip packing with release times , 2009, Theor. Comput. Sci..
[11] J. Hooker,et al. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .
[12] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[13] Andrew Lim,et al. A skyline heuristic for the 2D rectangular packing and strip packing problems , 2011, Eur. J. Oper. Res..
[14] Katsumi Inoue,et al. A SAT-based Method for Solving the Two-dimensional Strip Packing Problem , 2008, RCRA.
[15] John E. Beasley,et al. Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .
[16] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[17] Joe Marks,et al. Exhaustive approaches to 2D rectangular perfect packings , 2004, Inf. Process. Lett..
[18] J. Hooker,et al. Logic-based Benders decomposition , 2003 .
[19] Marco A. Boschetti,et al. An Exact Algorithm for the Two-Dimensional Strip-Packing Problem , 2010, Oper. Res..
[20] Ramón Alvarez-Valdés,et al. Reactive GRASP for the strip-packing problem , 2008, Comput. Oper. Res..
[21] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..
[22] Pedro M. Castro,et al. Scheduling inspired models for two-dimensional packing problems , 2011, Eur. J. Oper. Res..
[23] Alberto Caprara,et al. Bidimensional packing by bilinear programming , 2005, Math. Program..
[24] Kwang Mong Sim,et al. A two-stage intelligent search algorithm for the two-dimensional strip packing problem , 2011, Eur. J. Oper. Res..
[25] Hiroshi Nagamochi,et al. An exact strip packing algorithm based on canonical forms , 2012, Comput. Oper. Res..
[26] Klaus Jansen,et al. A (5 / 3 + ε ) -Approximation for Strip Packing ∗ , 2011 .
[27] Ramón Alvarez-Valdés,et al. A branch and bound algorithm for the strip packing problem , 2009, OR Spectr..
[28] Graham Kendall,et al. A squeaky wheel optimisation methodology for two-dimensional strip packing , 2011, Comput. Oper. Res..
[29] Matteo Fischetti,et al. Combinatorial Benders' Cuts for Mixed-Integer Linear Programming , 2006, Oper. Res..
[30] Daniele Vigo,et al. An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints , 2007, Transp. Sci..
[31] Vipul Jain,et al. Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..
[32] Chengbin Chu,et al. A COMPARATIVE STUDY OF EXACT ALGORITHMS FOR THE TWO DIMENSIONAL STRIP PACKING PROBLEM , 2007 .
[33] Graham Kendall,et al. A New Placement Heuristic for the Orthogonal Stock-Cutting Problem , 2004, Oper. Res..
[34] S. Martello,et al. Exact Solution of the Two-Dimensional Finite Bon Packing Problem , 1998 .
[35] Jacques Carlier,et al. A new exact method for the two-dimensional orthogonal packing problem , 2007, Eur. J. Oper. Res..
[36] Lazaros G. Papageorgiou,et al. A MILP model for N-dimensional allocation , 2007, Comput. Chem. Eng..
[37] Ignacio E. Grossmann,et al. A cutting plane method for solving linear generalized disjunctive programming problems , 2003 .
[38] Gleb Belov,et al. LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility , 2013, Oper. Res..
[39] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .
[40] Claire Mathieu,et al. A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem , 2000, Math. Oper. Res..
[41] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .