Pages that link to "Item:Q1411629"
From MaRDI portal
The following pages link to Dynamic knapsack sets and capacitated lot-sizing (Q1411629):
Displaying 14 items.
- A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing (Q922926) (← links)
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
- Single item lot-sizing problem for a warm/cold process with immediate lost sales (Q2467270) (← links)
- Sequential pairing of mixed integer inequalities (Q2471272) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing (Q2940071) (← links)