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):
Displaying 15 items.
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems (Q525062) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials (Q1737490) (← links)
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case (Q1754210) (← links)
- Economic lot-sizing problem with remanufacturing option: complexity and algorithms (Q2115304) (← links)
- Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure (Q2242374) (← links)
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (Q2668663) (← links)
- A rolling-horizon approach for multi-period optimization (Q2670577) (← links)
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem (Q2676332) (← 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)
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
