An approximately global optimization method for assortment problems

DOI10.1016/S0377-2217(97)00072-6zbMath0955.90082OpenAlexW1989267697MaRDI QIDQ1291783

Ching-Ter Chang, Han-Lin Li

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00072-6

zbMATH Keywords

global optimizationassortment

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Operations research and management science (90B99)

Related Items (9)

MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS ⋮ Optimal inventory policies for deteriorating complementary and substitute items ⋮ Solving packing problems by a distributed global optimization algorithm ⋮ A note on ``Reducing the number of binary variables in cutting stock problems ⋮ A fast algorithm for assortment optimization problems ⋮ An effective logarithmic formulation for piecewise linearization requiring no inequality constraint ⋮ Deterministic model for customized pilot manufacture production with various backplane sizes ⋮ On the mixed integer signomial programming problems ⋮ Approximately global optimization for assortment problems using piecewise linearization techniques

Cites Work

• An algorithm for the two-dimensional assortment problem
• The trim-loss and assortment problems: A survey
• 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: An approximately global optimization method for assortment problems