Pages that link to "Item:Q1881043"
From MaRDI portal
The following pages link to A study of the lot-sizing polytope (Q1881043):
Displaying 20 items.
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- DASH: dynamic approach for switching heuristics (Q320816) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← 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)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Valid inequalities for separable concave constraints with indicator variables (Q1801013) (← links)
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- Optimizing over the split closure (Q2476990) (← links)
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← 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)
- Multiechelon Lot Sizing: New Complexities and Inequalities (Q5131474) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem (Q6038656) (← links)
- Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)
- Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)
- Learning optimal solutions via an LSTM-optimization framework (Q6168346) (← links)