Pages that link to "Item:Q1291783"
From MaRDI portal
The following pages link to An approximately global optimization method for assortment problems (Q1291783):
Displaying 9 items.
- Approximately global optimization for assortment problems using piecewise linearization techniques (Q1848593) (← links)
- Solving packing problems by a distributed global optimization algorithm (Q1955364) (← links)
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint (Q2044490) (← links)
- Deterministic model for customized pilot manufacture production with various backplane sizes (Q2310672) (← links)
- A note on ``Reducing the number of binary variables in cutting stock problems'' (Q2448139) (← links)
- On the mixed integer signomial programming problems (Q2573603) (← links)
- Optimal inventory policies for deteriorating complementary and substitute items (Q3497795) (← links)
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS (Q5291406) (← links)
- A fast algorithm for assortment optimization problems (Q5945327) (← links)
