Pages that link to "Item:Q5429286"
From MaRDI portal
The following pages link to Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities (Q5429286):
Displaying 10 items.
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem (Q322625) (← links)
- Primal-dual schema for capacitated covering problems (Q747765) (← links)
- Multi-item lot-sizing with joint set-up costs (Q1013968) (← links)
- A metaheuristic approach to solving a multiproduct EOQ-based inventory problem with storage space constraints (Q1677303) (← links)
- Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
- Capacitated Arc Stabbing (Q2376793) (← links)
- LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
- Primal-Dual Schema for Capacitated Covering Problems (Q3503854) (← links)
- Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements (Q3602838) (← links)
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations (Q3730326) (← links)