An Inexact Bundle Approach to Cutting-Stock Problems
暂无分享,去创建一个
[1] Oliver Holthaus,et al. Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths , 2002, Eur. J. Oper. Res..
[2] Gerhard Wäscher,et al. Heuristics for the integer one-dimensional cutting stock problem: A computational study , 1996 .
[3] Claude Lemaréchal,et al. An inexact bundle variant suited to column generation , 2009, Math. Program..
[4] Gerhard Wäscher,et al. CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem , 1995 .
[5] Zeger Degraeve,et al. Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results , 2003, INFORMS J. Comput..
[6] Hartmut Stadtler,et al. A one-dimensional cutting stock problem in the aluminium industry and its solution , 1990 .
[7] Claude Lemaréchal,et al. Comparison of bundle and classical column generation , 2008, Math. Program..
[8] Krzysztof C. Kiwiel. A Proximal-Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming , 2006, SIAM J. Optim..
[9] Gleb Belov,et al. Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting , 2007, INFORMS J. Comput..
[10] J. V. D. Carvalho,et al. Cutting Stock Problems , 2005 .
[11] Jacques Desrosiers,et al. Stabilization in Column Generation , 2004 .
[12] 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..
[13] Jorge J. Moré,et al. Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .
[14] François Vanderbeck,et al. Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..
[15] Stefan Feltenmark,et al. Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems , 1999, SIAM J. Optim..
[16] K. Kiwiel. A Cholesky dual method for proximal piecewise linear programming , 1994 .
[17] José M. Valério de Carvalho. A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems , 2002, Comput. Optim. Appl..
[18] José M. Valério de Carvalho,et al. Using Extra Dual Cuts to Accelerate Column Generation , 2005, INFORMS J. Comput..
[19] Krzysztof C. Kiwiel,et al. A Proximal Bundle Method with Approximate Subgradient Linearizations , 2006, SIAM J. Optim..
[20] Ralph E. Gomory,et al. A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .
[21] François Vanderbeck,et al. On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..
[22] François Vanderbeck. Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem , 2002, Math. Program..
[23] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[24] Pamela H. Vance. Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..
[25] Gleb Belov,et al. Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm , 2001, J. Oper. Res. Soc..
[26] Christoph Nitsche,et al. Tighter relaxations for the cutting stock problem , 1999, Eur. J. Oper. Res..
[27] Gerhard Wäscher,et al. The bin-packing problem: A problem generator and some numerical experiments with FFD packing and MTP , 1997 .
[28] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[29] R. Gomory,et al. A Linear Programming Approach to the Cutting-Stock Problem , 1961 .
[30] Gleb Belov,et al. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths , 2002, Eur. J. Oper. Res..
[31] Zeger Degraeve,et al. Optimal Integer Solutions to Industrial Cutting Stock Problems , 1999, INFORMS J. Comput..