A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
From MaRDI portal
Publication:3114706
DOI10.1287/mnsc.47.6.864.9809zbMath1232.90326OpenAlexW2152891233MaRDI QIDQ3114706
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.47.6.864.9809
Related Items
Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns, Models for the two-dimensional two-stage cutting stock problem with multiple stock size, An improved typology of cutting and packing problems, Models and algorithms for three-stage two-dimensional bin packing, An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem, Arc-flow model for the two-dimensional guillotine cutting stock problem, Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, A new dynamic programming procedure for three-staged cutting patterns, Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming, Reducing the number of cuts in generating three-staged cutting patterns, A note on ``Reducing the number of binary variables in cutting stock problems, The Meet-in-the-Middle Principle for Cutting and Packing Problems, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies, Heuristic algorithm for a cutting stock problem in the steel bridge construction, Fast heuristic for constrained homogenous T-shape cutting patterns, Exact algorithms for the two-dimensional guillotine knapsack, Strip generation algorithms for constrained two-dimensional two-staged cutting problems, An integer programming model for two- and three-stage two-dimensional cutting stock problems, Probabilistic subproblem selection in branch-and-bound algorithms, A nested column generation algorithm to the meta slab allocation problem in the steel making industry, Exact solution techniques for two-dimensional cutting and packing, Algorithms for the one-dimensional two-stage cutting stock problem, Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints, Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation, Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers, Optimization of the distribution of small scale linear Fresnel reflectors on roofs of urban buildings, Sequential value correction heuristic for the two-dimensional cutting stock problem with three-staged homogenous patterns, Analysis of distributed genetic algorithms for solving cutting problems
