A fast algorithm for assortment optimization problems

DOI10.1016/S0305-0548(00)00035-6MaRDI QIDQ5945327zbMATH OpenOpenAlexFDO

Authors Han-Lin Li, Jung-Fa Tsai

Publication date 3 September 2003

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0305-0548(00)00035-6

zbMATH Keywords

assortment optimizationcuttinglinear mixed \(0-1\) programs

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Recommendations

• An approximately global optimization method for assortment problems
• A mixed-integer programming model for a class of assortment problems
• An algorithm for the two-dimensional assortment problem
• Approximately global optimization for assortment problems using piecewise linearization techniques
• scientific article; zbMATH DE number 1310285

Cites work

• A Note on a Two-dimensional Dynamic Programming Problem
• A mixed-integer programming model for a class of assortment problems
• An algorithm for the two-dimensional assortment problem
• An approximately global optimization method for assortment problems

Cited in

(8)

• Fast Approximation Methods for Sales Force Deployment
• A mixed-integer programming model for a class of assortment problems
• Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
• The maximum diversity assortment selection problem
• In-out algorithm for assortment planning under a ranking-based consumer choice model
• An efficient deterministic optimization approach for rectangular packing problems
• Approximately global optimization for assortment problems using piecewise linearization techniques

Describes a project that uses

Uses Software

• LINGO
• LINDO

This page was built for publication: A fast algorithm for assortment optimization problems

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