A comparison of solution methods for the assortment problem

DOI10.1080/00207549108948100MaRDI QIDQ3354860zbMATH OpenOpenAlexFDO

Authors Douglas D. Gemmill, Jerry L. Sanders

Publication date 1991

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207549108948100

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)

Cites work

• scientific article; zbMATH DE number 3809326 (Why is no real title available?)
• A Note on a Two-dimensional Dynamic Programming Problem
• An algorithm for the two-dimensional assortment problem
• The Discrete Two-Dimensional Assortment Problem

Cited in

(3)

• An optimization model for trim loss minimization in an automotive glass plant
• Determining the best shipper sizes for sending products to customers
• An exact algorithm for the clustered travelling salesman problem

This page was built for publication: A comparison of solution methods for the assortment problem

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