The following pages link to (Q4139966):
Displayed 25 items.
- Pricing, relaxing and fixing under lot sizing and scheduling (Q2355959) (← links)
- Efficient reformulations for dynamic lot-sizing problems with product substitution (Q2379664) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- Lot-sizing with fixed charges on stocks: the convex hull (Q2386201) (← links)
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms (Q2393142) (← links)
- Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
- The multi-item capacitated lot-sizing problem with setup times and shortage costs (Q2464221) (← links)
- Reformulation by discretization: application to economic lot sizing (Q2465954) (← links)
- Lot sizing with inventory gains (Q2467450) (← links)
- On formulations of the stochastic uncapacitated lot-sizing problem (Q2494816) (← links)
- A class of stochastic programs with decision dependent uncertainty (Q2502206) (← links)
- Single item lot sizing problems (Q2566041) (← links)
- Approximate extended formulations (Q2583138) (← links)
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (Q2668663) (← links)
- Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover (Q2668728) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Fixed-Charge Transportation on a Path: Linear Programming Formulations (Q3009780) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs (Q3598683) (← links)
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
- Multiechelon Lot Sizing: New Complexities and Inequalities (Q5131474) (← links)
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
- Split demand and deliveries in an integrated three-level lot sizing and replenishment problem (Q6065626) (← links)
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)