References
- Alvarez-ValdesRMartiRTamaritJMParajonAGRASP and path relinking for the two-dimensional two-stage cutting-stock problemINFORMS Journal on Computing200719226127210.1287/ijoc.1050.0169
- BeasleyJEAlgorithms for unconstrained two-dimensional guillotine cuttingJournal of the Operational Research Society198536429730610.1057/jors.1985.51
- BelovGScheithauerGA branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cuttingEuropean Journal of Operational Research200617118540610.1016/j.ejor.2004.08.036
- CintraGFMiyazawaFKWakabayashiYXavierACAlgorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generationEuropean Journal of Operational Research20081911618510.1016/j.ejor.2007.08.007
- Clautiaux F, Jouglet A and Moukrim A (2011). A new graph-theoretical model for the guillotine-cutting problem. INFORMS Journal on Computing, advance online publication, 17 October, doi: 10.1287/ijoc.1110.0478.
- GilmorePGomoryREA linear programming approach to the cutting stock problemOperations Research19619684985910.1287/opre.9.6.849
- GilmorePGomoryREA linear programming approach to the cutting stock problem—Part IIOperations Research196311686388810.1287/opre.11.6.863
- GilmorePGomoryREMultistage cutting stock problems of two and more dimensionsOperations Research19651319412010.1287/opre.13.1.94
- HifiMM'HallahRStrip generation algorithms for constrained two-dimensional two-staged cutting problemsEuropean Journal of Operational Research2006172251552710.1016/j.ejor.2004.10.020
- HifiMRoucairolCApproximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problemsJournal of Combinatorial Optimization20015446549410.1023/A:1011628809603
- LodiAMonaciMInteger linear programming models for two-staged two-dimensional knapsack problemsMathematical Programming Series B2003942–325727810.1007/s10107-002-0319-9
- MacedoRAlvesCValério de CarvalhoJMArc-flow model for the two-dimensional guillotine cutting stock problemComputers & Operations Research2010376991100110.1016/j.cor.2009.08.005
- PuchingerJRaidlGRModels and algorithms for three-stage two-dimensional bin packingEuropean Journal of Operational Research200712731304132710.1016/j.ejor.2005.11.064
- RiehmeJScheithauerGTernoJThe solution of two-stage guillotine cutting stock problems having extremely varying order demandsEuropean Journal of Operational Research199691354355210.1016/0377-2217(95)00200-6
- Valério de CarvalhoJMExact solution of bin-packing problems using column generation and branch-and-boundAnnals of Operations Research19998662965910.1023/A:1018952112615
- VanderbeckFA nested decomposition approach to a three-stage, two-dimensional cutting stock problemManagement Science200147686487910.1287/mnsc.47.6.864.9809