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

DOI10.1016/0377-2217(93)90116-5MaRDI QIDQ1804067zbMATH OpenOpenAlexFDO

Authors Chin-Sheng Chen, Sanjiv Sarin, Ram Balasubramanian

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

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

Recommendations

• A fast algorithm for assortment optimization problems
• An algorithm for the two-dimensional assortment problem
• Publication:3705224
• An approximately global optimization method for assortment problems
• A new nonlinear model for the two-dimensional rectangle packing problem

Cites work

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

Cited in

(8)

• How to select a small set of diverse solutions to mixed integer programming problems
• scientific article; zbMATH DE number 1310285 (Why is no real title available?)
• A note on ``Reducing the number of binary variables in cutting stock problems
• A fast algorithm for assortment optimization problems
• Finding multiple optimal solutions of signomial discrete programming problems with free variables
• A neural network system for solving an assortment problem in the steel industry
• An approximately global optimization method for assortment problems
• Deterministic model for customized pilot manufacture production with various backplane sizes

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

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