A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
暂无分享,去创建一个
[1] Harald Dyckhoff,et al. Cutting and Packing in Production and Distribution , 1992 .
[2] Andrea Lodi,et al. Strengthening Chvátal-Gomory cuts and Gomory fractional cuts , 2002, Oper. Res. Lett..
[3] Víctor Parada,et al. A comparative numerical analysis for the guillotine two-dimensional cutting problem , 2000, Ann. Oper. Res..
[4] Alexander Martin,et al. General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms , 2000, Computational Combinatorial Optimization.
[5] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[6] P. Y. Wang,et al. Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems , 1983, Oper. Res..
[7] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[8] Zeger Degraeve,et al. Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results , 2003, INFORMS J. Comput..
[9] Laurence A. Wolsey,et al. bc–opt: a branch-and-cut code for mixed integer programs , 1999, Math. Program..
[10] Gerhard Wäscher,et al. Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .
[11] Jürgen Rietz,et al. Tighter Bounds for the Gap and Non-IRUP Constructions in the One-dimensional Cutting Stock Problem , 2002 .
[12] G. Scheithauer,et al. The Number of Setups ( Different Patterns ) in One-Dimensional Stock Cutting , 2003 .
[13] G. Nemhauser,et al. Integer Programming , 2020 .
[14] George L. Nemhauser,et al. Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..
[15] Martin W. P. Savelsbergh,et al. A Computational Study of Search Strategies for Mixed Integer Programming , 1999, INFORMS J. Comput..
[16] Ellis L. Johnson,et al. Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..
[17] Cynthia Barnhart,et al. Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..
[18] G. Belov,et al. Models with Variable Strip Widths for Two-Dimensional Two-Stage Cutting , 2003 .
[19] Gleb Belov,et al. Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting , 2007, INFORMS J. Comput..
[20] Younes Alaoui. ILOG OPTIMIZATION SUITE WHITE PAPER: DISCOVERING A COMPETITIVE ADVANTAGE , 1997 .
[21] Mhand Hifi,et al. Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems , 2001, J. Comb. Optim..
[22] J. Decarvalho. Exact solution of cutting stock problems using column generation and branch-and-Bound , 1998 .
[23] Mhand Hifi,et al. Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems , 2001, Comput. Optim. Appl..
[24] Guntram Scheithauer,et al. The Modiied Integer Round-up Property of the One-dimensional Cutting Stock Problem , 1995 .
[25] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[26] François Soumis,et al. A two-phase heuristic for strip packing: Algorithm and probabilistic analysis , 1987 .
[27] 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..
[28] Robert W. Haessler,et al. Controlling Cutting Pattern Changes in One-Dimensional Trim Problems , 1975, Oper. Res..
[29] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[30] Hans Kellerer,et al. Knapsack problems , 2004 .
[31] Christoph Nitsche,et al. Tighter relaxations for the cutting stock problem , 1999, Eur. J. Oper. Res..
[32] S. Martello,et al. Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem , 1999 .
[33] Guntram Scheithauer,et al. A branch-and-cut-and-price algorithm for one- and two-dimensional two-staged cutting (stock) problems , 2003 .
[34] Mhand Hifi,et al. Strip generation algorithms for constrained two-dimensional two-staged cutting problems , 2004, Eur. J. Oper. Res..
[35] Harald Dyckhoff,et al. A typology of cutting and packing problems , 1990 .
[36] J. V. D. Carvalho. Exact solution of cutting stock problems using column generation and branch-and-Bound 1 1 Paper pres , 1998 .
[37] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[38] José M. Valério de Carvalho,et al. LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..
[39] Guntram Scheithauer,et al. A branch&bound algorithm for solving one-dimensional cutting stock problems exactly , 1995 .
[40] John E. Beasley,et al. Algorithms for Unconstrained Two-Dimensional Guillotine Cutting , 1985 .
[41] François Vanderbeck,et al. Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem , 2000, Oper. Res..
[42] Egon Balas,et al. Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..
[43] Andrea Lodi,et al. Integer linear programming models for 2-staged two-dimensional Knapsack problems , 2003, Math. Program..
[44] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[45] Gleb Belov,et al. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths , 2002, Eur. J. Oper. Res..
[46] E. A. Mukhachiova,et al. Linear Programming Cutting Problems , 1993, Int. J. Softw. Eng. Knowl. Eng..
[47] Peter Trkman,et al. One-dimensional cutting stock optimization in consecutive time periods , 2007, Eur. J. Oper. Res..
[48] François Vanderbeck,et al. Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..
[49] Robert E. Johnston,et al. A new model for complete solutions to one-dimensional cutting stock problems , 2004, Eur. J. Oper. Res..
[50] Emanuel Falkenauer,et al. A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.
[51] G S C H E I T H A U,et al. A BRANCH&BOUND ALGORITHM FOR SOLVING ONE-DIMENSIONAL CUTTING STOCK PROBLEMS EXACTLY , 1995 .
[52] Gleb Belov,et al. Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm , 2001, J. Oper. Res. Soc..
[53] R. Gomory,et al. Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .