Pages that link to "Item:Q1026766"
From MaRDI portal
The following pages link to Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs (Q1026766):
Displaying 14 items.
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem (Q896282) (← links)
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
- Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← 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)
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging (Q1727732) (← links)
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285) (← links)
- Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
- Robust formulations for economic lot-sizing problem with remanufacturing (Q2028886) (← links)
- A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864) (← links)
- Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
