A fast algorithm for assortment optimization problems

DOI10.1016/S0305-0548(00)00035-6zbMath1017.90094OpenAlexW2060615484MaRDI QIDQ5945327

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)

Related Items (2)

MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS ⋮ An efficient deterministic optimization approach for rectangular packing problems

Uses Software

• LINDO
• LINGO

Cites Work

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

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