An approximately global optimization method for assortment problems

DOI10.1016/S0377-2217(97)00072-6zbMATH Open0955.90082OpenAlexW1989267697MaRDI QIDQ1291783FDOQ1291783

Authors: Han-Lin Li, Ching-Ter Chang 

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

Recommendations

• A fast algorithm for assortment optimization problems
• Approximately global optimization for assortment problems using piecewise linearization techniques
• scientific article; zbMATH DE number 906532
• An algorithm for the two-dimensional assortment problem

zbMATH Keywords

global optimizationassortment

Mathematics Subject Classification ID

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

Cites Work

• The trim-loss and assortment problems: A survey
• A Note on a Two-dimensional Dynamic Programming Problem
• An algorithm for the two-dimensional assortment problem
• A mixed-integer programming model for a class of assortment problems

Cited In (10)

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

This page was built for publication: An approximately global optimization method for assortment problems

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