A mixed-integer programming model for a class of assortment problems

DOI10.1016/0377-2217(93)90116-5zbMath0768.90060OpenAlexW1972762119MaRDI QIDQ1804067

Chin-Sheng Chen, Ram Balasubramanian, Sanjiv Sarin

Publication date: 29 June 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90116-5

zbMATH Keywords

two-dimensional stock-cutting

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Related Items (6)

A neural network system for solving an assortment problem in the steel industry ⋮ Finding multiple optimal solutions of signomial discrete programming problems with free variables ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ A fast algorithm for assortment optimization problems ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ An approximately global optimization method for assortment problems

Cites Work

• An algorithm for the two-dimensional assortment problem
• The trim-loss and assortment problems: A survey
• A Note on a Two-dimensional Dynamic Programming Problem

This page was built for publication: A mixed-integer programming model for a class of assortment problems