Exact and asymptotically exact solutions for a class of assortment problems

DOI10.1287/IJOC.1080.0274MaRDI QIDQ2901042zbMATHOpenAlexFDO

Authors Claudio Arbib, Fabrizio Marinelli

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/6c088d7e1ef7063795be0f94328922813a643589

zbMATH Keywords

integer programmingcutting stock\(p\)-mediandeterministic inventory

Mathematics Subject Classification ID

Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Recommendations

• A branch-and-cut algorithm for the latent class logit assortment problem
• A branch-and-cut algorithm for the latent-class logit assortment problem
• Optimal assortment with concave cost functions
• scientific article; zbMATH DE number 1310285
• An exact method for assortment optimization under the nested logit model

Cited in

(4)

• An efficient deterministic optimization approach for rectangular packing problems
• Mass customization and ``forecasting options' penetration rates problem
• Determining the best shipper sizes for sending products to customers
• One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model

This page was built for publication: Exact and asymptotically exact solutions 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 Q2901042)