Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers

Alvarez-Valdes, 2002, A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems, OR Spectr, 24, 179, 10.1007/s00291-002-0093-3

Andrade, 2016, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, Int Trans Oper Res, 23, 121, 10.1111/itor.12077

Beasley, 1985, Algorithms for unconstrained two-dimensional guillotine cutting, J Oper Res Soc, 36, 297, 10.1057/jors.1985.51

Berkey, 1987, Two-dimensional finite bin-packing algorithms, J Oper Res Soc, 38, 423, 10.1057/jors.1987.70

Cintra, 2008, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Eur J Oper Res, 191, 61, 10.1016/j.ejor.2007.08.007

Clautiaux, 2018, Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem, Discrete Optim, 29, 18, 10.1016/j.disopt.2018.02.003

Dolatabadi, 2012, Exact algorithms for the two-dimensional guillotine knapsack, Comput Oper Res, 39, 48, 10.1016/j.cor.2010.12.018

Dusberger F, Raidl GR (2014) A variable neighborhood search using very large neighborhood structures for the 3-staged 2-dimensional cutting stock problem. In: Blesa MJ, Blum C, Voß S (eds) Hybrid metaheuristics: 9th International Workshop, HM 2014, Hamburg, Germany, 11–13 June 2014. Proceedings. Springer, Cham, pp 85–99

Dusberger, 2015, Solving the 3-staged 2-dimensional cutting stock problem by dynamic programming and variable neighborhood search, Electron Notes Discrete Math, 47, 133, 10.1016/j.endm.2014.11.018

Fleszar, 2013, Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts, Comput Oper Res, 40, 463, 10.1016/j.cor.2012.07.016

Furini, 2012, A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size, Eur J Oper Res, 218, 251, 10.1016/j.ejor.2011.10.018

Furini, 2016, Modeling two-dimensional guillotine cutting problems via integer programming, INFORMS J Comput, 28, 736, 10.1287/ijoc.2016.0710

Gilmore, 1965, Multistage cutting stock problems of two and more dimensions, Oper Res, 13, 94, 10.1287/opre.13.1.94

Hadjiconstantinou, 2007, A hybrid genetic algorithm for the two-dimensional single large object placement problem, Eur J Oper Res, 183, 1150, 10.1016/j.ejor.2005.11.061

Lodi, 2003, Integer linear programming models for 2-staged two-dimensional knapsack problems, Math Program, 94, 257, 10.1007/s10107-002-0319-9

Lodi, 2002, Recent advances on two-dimensional bin packing problems, Discrete Appl Math, 123, 379, 10.1016/S0166-218X(01)00347-X

Macedo, 2010, Arc-flow model for the two-dimensional guillotine cutting stock problem, Comput Oper Res, 37, 991, 10.1016/j.cor.2009.08.005

Martello, 1998, Exact solution of the two-dimensional finite bin packing problem, Manag Sci, 44, 388, 10.1287/mnsc.44.3.388

Martin, 1990, Polyhedral characterization of discrete dynamic programming, Oper Res, 38, 127, 10.1287/opre.38.1.127

Pessoa, 2018, automation and combination of linear-programming based stabilization techniques in column generation, INFORMS J Comput, 30, 339, 10.1287/ijoc.2017.0784

Polyakovsky, 2009, An agent-based approach to the two-dimensional guillotine bin packing problem, Eur J Oper Res, 192, 767, 10.1016/j.ejor.2007.10.020

Puchinger, 2007, Models and algorithms for three-stage two-dimensional bin packing, Eur J Oper Res, 183, 1304, 10.1016/j.ejor.2005.11.064

Puchinger J, Raidl GR, Koller G (2004) Solving a real-world glass cutting problem. In: Gottlieb J, Raidl GR (eds) Evolutionary computation in combinatorial optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, 5–7 April 2004. Proceedings. Springer, Berlin, pp 165–176

Russo, 2014, An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems, Comput Oper Res, 50, 97, 10.1016/j.cor.2014.04.001

Sadykov, 2019, Primal heuristics for branch-and-price: the assets of diving methods, INFORMS J Comput, 10.1287/ijoc.2018.0822

Silva, 2010, An integer programming model for two-and three-stage two-dimensional cutting stock problems, Eur J Oper Res, 205, 699, 10.1016/j.ejor.2010.01.039

Valério de Carvalho, 1999, Exact solution of bin-packing problems using column generation and branch-and-bound, Ann Oper Res, 86, 629, 10.1023/A:1018952112615

Vanderbeck, 2001, A nested decomposition approach to a three-stage, two-dimensional cutting-stock problem, Manag Sci, 47, 864, 10.1287/mnsc.47.6.864.9809