An approximately global optimization method for assortment problems
From MaRDI portal
Publication:1291783
Recommendations
Cites work
Cited in
(10)- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- A note on ``Reducing the number of binary variables in cutting stock problems
- A fast algorithm for assortment optimization problems
- A mixed-integer programming model for a class of assortment problems
- Optimal inventory policies for deteriorating complementary and substitute items
- Solving packing problems by a distributed global optimization algorithm
- 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
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)