Pages that link to "Item:Q1935570"
From MaRDI portal
The following pages link to A computational analysis of lower bounds for big bucket production planning problems (Q1935570):
Displayed 7 items.
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
- A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times (Q2830951) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- Fixed-Charge Transportation on a Path: Linear Programming Formulations (Q3009780) (← links)
- Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem (Q4599321) (← links)