An algorithm for the two-dimensional assortment problem

DOI10.1016/0377-2217(85)90179-1zbMATH Open0553.90062OpenAlexW1986354852MaRDI QIDQ759646FDOQ759646

Authors: J. E. Beasley 

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

Recommendations

• An algorithm for the 2D guillotine cutting stock problem
• An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
• An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
• A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting

zbMATH Keywords

heuristic algorithmcutting stockguillotine cuttingComputational resultsgreedy proceduretwo-dimensional assortment problemtwo-dimensional cutting patterns

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Applications of mathematical programming (90C90) Operations research and management science (90B99)

Cites Work

• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
• Title not available (Why is that?)
• The trim-loss and assortment problems: A survey
• A New Linear Programming Approach to the Cutting Stock Problem
• The Theory and Computation of Knapsack Functions
• A Note on a Two-dimensional Dynamic Programming Problem

Cited In (23)

• An optimization model for trim loss minimization in an automotive glass plant
• Title not available (Why is that?)
• A note on ``Reducing the number of binary variables in cutting stock problems
• Solving packing problems by a distributed global optimization algorithm
• The Discrete Two-Dimensional Assortment Problem
• A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
• A dynamic programming based heuristic for industrial buying of cardboard
• A mixed-integer programming model for a class of assortment problems
• Heuristic methods and applications: A categorized survey
• An approximately global optimization method for assortment problems
• A multi-objective programming approach to 1.5-dimensional assortment problem
• A comparison of solution methods for the assortment problem
• A column generation procedure for gang-rip saw arbor design and scheduling
• A fast algorithm for assortment optimization problems
• Determining the best shipper sizes for sending products to customers
• A search strategy for the one-size assortment problem
• Two-dimensional homing sort
• Title not available (Why is that?)
• Approximation solutions for the cutting stock `portfolio' problem
• Solution to the assortment problem via the genetic algorithm
• An asymptotic distribution-free selection procedure for a two-way layout problem
• Knowledge-based systems for cutting stock problems
• Title not available (Why is that?)

This page was built for publication: An algorithm for the two-dimensional assortment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759646)