The following pages link to (Q4840775):
Displaying 17 items.
- A polyhedral study of production ramping (Q304233) (← links)
- 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)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs (Q1374379) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs (Q1807930) (← links)
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
- A stochastic programming approach for planning horizons of infinite horizon capacity planning problems (Q2379527) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- Lot-sizing with fixed charges on stocks: the convex hull (Q2386201) (← links)
- Single item lot-sizing problem for a warm/cold process with immediate lost sales (Q2467270) (← links)
- Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size (Q5388050) (← links)
