A comparison of solution methods for the assortment problem

DOI10.1080/00207549108948100zbMath0729.90826OpenAlexW2056399799MaRDI QIDQ3354860

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) Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

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

Cites Work

• Unnamed Item
• An algorithm for the two-dimensional assortment problem
• The Discrete Two-Dimensional Assortment Problem
• A Note on a Two-dimensional Dynamic Programming Problem

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