Conservative scales in packing problems
暂无分享,去创建一个
Gleb Belov | Guntram Scheithauer | Heide Rohling | Vadim M. Kartak | G. Scheithauer | V. Kartak | G. Belov | H. Rohling
[1] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[2] Nicholas I. M. Gould,et al. An algorithm for nonlinear optimization using linear programming and equality constrained subproblems , 2004, Math. Program..
[3] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[4] Gleb Belov,et al. One-dimensional relaxations and LP bounds for orthogonal packing , 2009, Int. Trans. Oper. Res..
[5] Jacques Carlier,et al. Computing redundant resources for the resource constrained project scheduling problem , 2007, Eur. J. Oper. Res..
[6] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[7] Marco A. Boschetti,et al. An Exact Algorithm for the Two-Dimensional Strip-Packing Problem , 2010, Oper. Res..
[8] Sándor P. Fekete,et al. A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems , 2004, Math. Methods Oper. Res..
[9] Roberto Baldacci,et al. A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem , 2007, Eur. J. Oper. Res..
[10] Cláudio Alves,et al. Theoretical investigations on maximal dual feasible functions , 2010, Oper. Res. Lett..
[11] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..
[12] Sándor P. Fekete,et al. New Classes of Lower Bounds for Bin Packing Problems , 1998, IPCO.
[13] Alberto Caprara,et al. On the two-dimensional Knapsack Problem , 2004, Oper. Res. Lett..
[14] Alberto Caprara,et al. Bidimensional packing by bilinear programming , 2005, Math. Program..
[15] Christodoulos A. Floudas,et al. ADVANCES FOR THE POOLING PROBLEM: MODELING, GLOBAL OPTIMIZATION, AND COMPUTATIONAL STUDIES , 2009 .
[16] Cláudio Alves,et al. A survey of dual-feasible and superadditive functions , 2010, Ann. Oper. Res..
[17] Hans Kellerer,et al. Knapsack problems , 2004 .
[18] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[19] Sándor P. Fekete,et al. A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing , 2003, Math. Oper. Res..
[20] George S. Lueker,et al. Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[21] Mats Carlsson,et al. New filtering for the cumulative constraint in the context of non-overlapping rectangles , 2008, Ann. Oper. Res..
[22] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[23] W. Marsden. I and J , 2012 .
[24] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[25] El-Ghazali Talbi,et al. New lower bounds for bin packing problems with conflicts , 2010, Eur. J. Oper. Res..
[26] Marco A. Boschetti,et al. The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case , 2003, 4OR.
[27] David Pisinger,et al. Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem , 2007, INFORMS J. Comput..
[28] Stephan Dempe,et al. Large gaps in one-dimensional cutting stock problems , 2008, Discret. Appl. Math..
[29] Jacques Carlier,et al. New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation , 2007, Comput. Oper. Res..
[30] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[31] Sándor P. Fekete,et al. New classes of fast lower bounds for bin packing problems , 2001, Math. Program..
[32] R. F. Drenick,et al. Multilinear programming: Duality theories , 1992 .
[33] Antoine Jouglet,et al. A new constraint programming approach for the orthogonal packing problem , 2008, Comput. Oper. Res..
[34] Marco A. Boschetti,et al. The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds , 2003, 4OR.
[35] Cláudio Alves,et al. Worst-case analysis of maximal dual feasible functions , 2012, Optim. Lett..
[36] Jacques Carlier,et al. New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem , 2009 .
[37] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[38] Guntram Scheithauer,et al. Families of Non-irup Instances of the One-dimensional Cutting Stock Problem Families of Non-irup Instances of the One-dimensional Cutting Stock Problem , 1998 .
[39] Ramón Alvarez-Valdés,et al. A branch and bound algorithm for the strip packing problem , 2009, OR Spectr..
[40] L. Lasdon,et al. Nonlinear Optimization by Successive Linear Programming , 1982 .
[41] Leon S. Lasdon,et al. An Improved Successive Linear Programming Algorithm , 1985 .
[42] Sándor P. Fekete,et al. An Exact Algorithm for Higher-Dimensional Orthogonal Packing , 2006, Oper. Res..
[43] Cláudio Alves,et al. New Stabilization Procedures for the Cutting Stock Problem , 2011, INFORMS J. Comput..
[44] Kathryn A. Dowsland,et al. The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems , 1984 .
[45] Tapio Westerlund,et al. A linear programming-based optimization algorithm for solving nonlinear programming problems , 2010, Eur. J. Oper. Res..