An algorithm for the two-dimensional assortment problem
From MaRDI portal
Publication:759646
DOI10.1016/0377-2217(85)90179-1zbMath0553.90062OpenAlexW1986354852MaRDI QIDQ759646
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90179-1
heuristic algorithmcutting stockguillotine cuttingComputational resultsgreedy proceduretwo-dimensional assortment problemtwo-dimensional cutting patterns
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Linear programming (90C05) Operations research and management science (90B99)
Related Items
An optimization model for trim loss minimization in an automotive glass plant, Solving packing problems by a distributed global optimization algorithm, A note on ``Reducing the number of binary variables in cutting stock problems, Solution to the assortment problem via the genetic algorithm, A fast algorithm for assortment optimization problems, A comparison of solution methods for the assortment problem, Determining the best shipper sizes for sending products to customers, A mixed-integer programming model for a class of assortment problems, Heuristic methods and applications: A categorized survey, Approximation solutions for the cutting stock `portfolio' problem, Knowledge-based systems for cutting stock problems, An approximately global optimization method for assortment problems, A column generation procedure for gang-rip saw arbor design and scheduling
Cites Work
- Unnamed Item
- The trim-loss and assortment problems: A survey
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A New Linear Programming Approach to the Cutting Stock Problem
- A Note on a Two-dimensional Dynamic Programming Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- The Theory and Computation of Knapsack Functions
