Cutting and packing : problems, models and exact algorithms

Tese de doutoramento em Engenharia de Producao e Sistemas, area de Investigacao Operacional

[1]  János Csirik.  An on-line algorithm for variable-sized bin packing , 2004, Acta Informatica.

[2]  Constantine Goulimis.  Optimal solutions for the cutting stock problem , 1990 .

[3]  Miro Gradisar,et al.  Evaluation of algorithms for one-dimensional cutting , 2002, Comput. Oper. Res..

[4]  Laurence A. Wolsey,et al.  An exact algorithm for IP column generation , 1994, Oper. Res. Lett..

[5]  Donald Goldfarb,et al.  Steepest-edge simplex algorithms for linear programming , 1992, Math. Program..

[6]  Gerhard Wäscher,et al.  An improved typology of cutting and packing problems , 2007, Eur. J. Oper. Res..

[7]  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..

[8]  Harald Dyckhoff,et al.  Cutting and packing in production and distribution : a typology and bibliography , 1992 .

[9]  Hartmut Stadtler,et al.  A one-dimensional cutting stock problem in the aluminium industry and its solution , 1990 .

[10]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[11]  Miro Gradisar,et al.  Optimization of roll cutting in clothing industry , 1997, Comput. Oper. Res..

[12]  Frank D. Murgolo.  An Efficient Approximation Scheme for Variable-Sized Bin Packing , 1987, SIAM J. Comput..

[13]  Zeger Degraeve,et al.  Optimal Integer Solutions to Industrial Cutting Stock Problems , 1999, INFORMS J. Comput..

[14]  Jacques Desrosiers,et al.  On Compact Formulations for Integer Programs Solved by Column Generation , 2005, Ann. Oper. Res..

[15]  Robert W. Haessler,et al.  Controlling Cutting Pattern Changes in One-Dimensional Trim Problems , 1975, Oper. Res..

[16]  Andrea Lodi,et al.  Two-dimensional packing problems: A survey , 2002, Eur. J. Oper. Res..

[17]  LEAH EPSTEIN,et al.  New Bounds for Variable-Sized Online Bin Packing , 2003, SIAM J. Comput..

[18]  Michele Monaci,et al.  Algorithms for packing and scheduling problems , 2003, 4OR.

[19]  Harald Dyckhoff,et al.  A New Linear Programming Approach to the Cutting Stock Problem , 1981, Oper. Res..

[20]  Barrie M. Baker.  A spreadsheet modelling approach to the assortment problem , 1999, Eur. J. Oper. Res..

[21]  L. Appelgren.  Integer Programming Methods for a Vessel Scheduling Problem , 1971 .

[22]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[23]  Pamela H. Vance,et al.  Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..

[24]  Hans Kellerer,et al.  Knapsack problems , 2004 .

[25]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[26]  A. Löbel.  Optimale Vehicle Scheduling in Public Transit , 1997 .

[27]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[28]  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..

[29]  Gleb Belov,et al.  A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths , 2002, Eur. J. Oper. Res..

[30]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[31]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[32]  A. A. Farley.  A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems , 1990, Oper. Res..

[33]  Robert W. Haessler,et al.  One-dimensional cutting stock decisions for rolls with multiple quality grades , 1990 .

[34]  H. Stadtler,et al.  A comparison of two optimization procedures for 1- and 1 1/2-dimensional cutting stock problems , 1988 .

[35]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[36]  François Vanderbeck,et al.  Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem , 2000, Oper. Res..

[37]  Boon J. Yuen.  Heuristics for sequencing cutting patterns , 1991 .

[38]  Mikael Rönnqvist.  A method for the cutting stock problem with different qualities , 1995 .

[39]  Gerhard Wäscher,et al.  CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem , 1995 .

[40]  Zeger Degraeve,et al.  Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results , 2003, INFORMS J. Comput..

[41]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[42]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[43]  George L. Nemhauser,et al.  Solving binary cutting stock problems by column generation and branch-and-bound , 1994, Comput. Optim. Appl..

[44]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[45]  Guochuan Zhang,et al.  Worst-Case analysis of the FFH algorithm for online variable-sized bin packing , 1996, Computing.

[46]  Cliff T. Ragsdale,et al.  The Ordered Cutting Stock Problem , 2004, Decis. Sci..

[47]  Chuen-Lung Chen,et al.  A simulated annealing heuristic for the one-dimensional cutting stock problem , 1996 .

[48]  J. Decarvalho.  Exact solution of cutting stock problems using column generation and branch-and-Bound , 1998 .

[49]  A. I. Hinxman.  The trim-loss and assortment problems: A survey , 1980 .

[50]  Gerhard Wäscher,et al.  Simulated annealing for order spread minimization in sequencing cutting patterns , 1998, Eur. J. Oper. Res..

[51]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[52]  Gary M. Roodman.  Near-optimal solutions to one-dimensional cutting stock problems , 1986, Comput. Oper. Res..

[53]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

[54]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[55]  Kenneth Schilling.  The growth of m-constraint random knapsacks , 1990 .

[56]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

[57]  R. E. Marsten,et al.  The Boxstep Method for Large-Scale Optimization , 2011, Oper. Res..

[58]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[59]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[60]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[61]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[62]  Jesper Larsen,et al.  Lagrangean duality applied on vehicle routing with time windows , 2001 .

[63]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[64]  Jacques Desrosiers,et al.  Selected Topics in Column Generation , 2002, Oper. Res..

[65]  Toshihide Ibaraki,et al.  One-dimensional cutting stock problem to minimize the number of different patterns , 2003, Eur. J. Oper. Res..

[66]  Odile Marcotte.  An instance of the cutting stock problem for which the rounding property does not hold , 1986 .

[67]  Sungsoo Park,et al.  Algorithms for the variable sized bin packing problem , 2003, Eur. J. Oper. Res..

[68]  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..

[69]  R. W. Haessler,et al.  Cutting stock problems and solution procedures , 1991 .

[70]  James R. Evans,et al.  Aggregation and Disaggregation Techniques and Methodology in Optimization , 1991, Oper. Res..

[71]  Gleb Belov,et al.  Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm , 2001, J. Oper. Res. Soc..

[72]  M. Pirlot,et al.  Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem , 1995 .

[73]  Ravindra K. Ahuja,et al.  A Fast and Simple Algorithm for the Maximum Flow Problem , 2011, Oper. Res..

[74]  Colin McDiarmid.  Pattern Minimisation in Cutting Stock Problems , 1999, Discret. Appl. Math..

[75]  Sungsoo Park,et al.  A polyhedral approach to edge coloring , 1991, Oper. Res. Lett..

[76]  Jean-Philippe Vial,et al.  On Improvements to the Analytic Center Cutting Plane Method , 1998, Comput. Optim. Appl..

[77]  John L. Nazareth,et al.  The decomposition principle and algorithms for linear programming , 1991 .

[78]  George S. Lueker,et al.  Bin packing with items uniformly distributed over intervals [a,b] , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[79]  José M. Valério de Carvalho,et al.  Using Extra Dual Cuts to Accelerate Column Generation , 2005, INFORMS J. Comput..

[80]  Steven S. Seiden,et al.  An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing , 2000, SIAM J. Discret. Math..

[81]  Robert E. Bixby,et al.  Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods , 1992, Oper. Res..

[82]  Guntram Scheithauer,et al.  The Modiied Integer Round-up Property of the One-dimensional Cutting Stock Problem , 1995 .

[83]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[84]  Edward G. Coffman,et al.  Bin packing with divisible item sizes , 1987, J. Complex..

[85]  Miro Gradisar,et al.  A sequential heuristic procedure for one-dimensional cutting , 1999, Eur. J. Oper. Res..

[86]  Odile Marcotte.  The cutting stock problem and integer rounding , 1985, Math. Program..

[87]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

[88]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[89]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[90]  Leif H. Appelgren,et al.  A Column Generation Algorithm for a Ship Scheduling Problem , 1969 .

[91]  Chengbin Chu,et al.  Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms , 2001, SIAM J. Comput..

[92]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[93]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[94]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[95]  R. W. Haessler.  A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem , 1971 .

[96]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[97]  José M. Valério de Carvalho,et al.  LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..

[98]  José Fernando Oliveira,et al.  A 2-exchange heuristic for nesting problems , 2002, Eur. J. Oper. Res..

[99]  Harald Dyckhoff,et al.  A typology of cutting and packing problems , 1990 .

[100]  François Vanderbeck,et al.  Computational study of a column generation algorithm for bin packing and cutting stock problems , 1999, Math. Program..

[101]  W. Wilhelm.  A Technical Review of Column Generation in Integer Programming , 2001 .

[102]  E. E. Bischoff,et al.  Loading Multiple Pallets , 1995 .

[103]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[104]  Michael A. Langston,et al.  Online variable-sized bin packing , 1989, Discret. Appl. Math..

[105]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[106]  D. K. Friesen,et al.  Variable Sized Bin Packing , 1986, SIAM J. Comput..

[107]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[108]  H. Foerster,et al.  Pattern reduction in one-dimensional cutting stock problems , 2000 .

[109]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[110]  Emanuel Falkenauer.  Tapping the Full Power of Genetic Algorithm through Suitable Representation and Local Optimization: Application to Bin Packing , 1995 .

[111]  J. Oliveira,et al.  Solving nesting problems with non‐convex polygons by constraint logic programming , 2003 .

[112]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[113]  Oliver Holthaus,et al.  On the best number of different standard lengths to stock for one-dimensional assortment problems , 2003 .