A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
暂无分享,去创建一个
José M. Valério de Carvalho | John Martinovic | Guntram Scheithauer | G. Scheithauer | J. Martinovic | J. M. V. Carvalho
[1] Manuel Iori,et al. Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems , 2020, INFORMS J. Comput..
[2] Gleb Belov,et al. A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting , 2006, Eur. J. Oper. Res..
[3] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[4] José M. Valério de Carvalho,et al. LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..
[5] John Martinovic,et al. Integer linear programming models for the skiving stock problem , 2016, Eur. J. Oper. Res..
[6] Cláudio Alves,et al. Accelerating column generation for variable sized bin-packing problems , 2007, Eur. J. Oper. Res..
[7] Miro Gradisar,et al. Optimization of roll cutting in clothing industry , 1997, Comput. Oper. Res..
[8] Cláudio Alves,et al. A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem , 2008, Comput. Oper. Res..
[9] Eduard A. Jorswieck,et al. The Skiving Stock Problem and its Application to Cognitive Radio Networks , 2016 .
[10] Gerhard Wäscher,et al. CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem , 1995 .
[11] John Martinovic,et al. The proper relaxation and the proper gap of the skiving stock problem , 2016, Math. Methods Oper. Res..
[12] João Pedro Pedroso,et al. Bin packing and related problems: General arc-flow formulation with graph compression , 2013, Comput. Oper. Res..
[13] Manuel Iori,et al. Bin packing and cutting stock problems: Mathematical models and exact algorithms , 2016, Eur. J. Oper. Res..
[14] H. Dyckhoff,et al. Vergleich zweier Modelle zur Lösung eines konkreten Verschnitt- und Lagerbestandsplanungsproblems , 1982 .
[15] Gerhard Wäscher,et al. Integer linear programming for a cutting problem in the wood-processing industry: a case study , 2009, Int. Trans. Oper. Res..
[16] J. C. Herz,et al. Recursive computational procedure for two-dimensional stock cutting , 1972 .
[17] John Martinovic,et al. Integer rounding and modified integer rounding for the skiving stock problem , 2016, Discret. Optim..
[18] Hartmut Stadtler,et al. A one-dimensional cutting stock problem in the aluminium industry and its solution , 1990 .
[19] José M. Valério de Carvalho,et al. An integer programming model for two- and three-stage two-dimensional cutting stock problems , 2010, Eur. J. Oper. Res..
[20] Gerhard Wäscher,et al. An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..
[21] Christoph Nitsche,et al. Tighter relaxations for the cutting stock problem , 1999, Eur. J. Oper. Res..
[22] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[23] Fabio Furini,et al. Models for the two-dimensional two-stage cutting stock problem with multiple stock size , 2013, Comput. Oper. Res..
[24] E. J. Zak. The skiving stock problem as a counterpart of the cutting stock problem , 2003 .
[25] 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 .
[26] Harald Dyckhoff. Bridges between Two Principal Model Formulations for Cutting Stock Processes , 1991 .
[27] H. Stadtler,et al. A comparison of two optimization procedures for 1- and 1 1/2-dimensional cutting stock problems , 1988 .
[28] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[29] Cláudio Alves,et al. Arc-flow model for the two-dimensional guillotine cutting stock problem , 2010, Comput. Oper. Res..
[30] Sascha Kurz,et al. Minimal Proper Non-IRUP Instances of the One-Dimensional Cutting Stock Problem , 2014, Discret. Appl. Math..
[31] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[32] Filipe Brandão. VPSolver 3: Multiple-choice Vector Packing Solver , 2016, ArXiv.
[33] Gerhard Knolmayer,et al. Computational experiments in the formulation of linear product-mix and non-convex production-investment models , 1982, Comput. Oper. Res..
[34] L. V. Kantorovich,et al. Mathematical Methods of Organizing and Planning Production , 1960 .
[35] Harald Dyckhoff,et al. A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..
[36] Nicos Christofides,et al. An Algorithm for Two-Dimensional Cutting Problems , 1977, Oper. Res..
[37] Steffen Rebennack,et al. Solving real-world cutting stock-problems in the paper industry: Mathematical approaches, experience and challenges , 2014, Eur. J. Oper. Res..
[38] Guntram Scheithauer,et al. The modified integer round-up property of the one-dimensional cutting stock problem , 1995 .
[39] Stephan Dempe,et al. Large gaps in one-dimensional cutting stock problems , 2008, Discret. Appl. Math..
[40] Pamela H. Vance,et al. Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..
[41] Laurence A. Wolsey. Valid inequalities, covering problems and discrete dynamic programs , 1977 .
[42] John Martinovic,et al. Integer Linear Programming Formulations for Cognitive Radio Resource Allocation , 2017, IEEE Wireless Communications Letters.
[43] José M. Valério de Carvalho,et al. Exact solution of bin-packing problems using column generation and branch-and-bound , 1999, Ann. Oper. Res..
[44] Reinaldo Morabito,et al. The cutting stock problem in a hardboard industry: a case study , 1998, Comput. Oper. Res..