Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
From MaRDI portal
Recommendations
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- scientific article; zbMATH DE number 1560348
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Period decompositions for the capacitated lot sizing problem with setup times
Cited in
(20)- Decomposition in multi-item inventory control
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
- CMIT, capacitated multi-level implosion tool
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- A novel decomposition approach for on-line lot-sizing.
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Discrete multi-module capacitated lot-sizing problems with multiple items
- A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
- Period decompositions for the capacitated lot sizing problem with setup times
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- scientific article; zbMATH DE number 1560348 (Why is no real title available?)
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- Lagrangean heuristic for a multi-plant lot-sizing problem with transfer and storage capacities
- Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping
- An implementation of Lagrangian decomposition in solving a multi-item production scheduling problem with changeover cost and restrictions
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
This page was built for publication: Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3142312)
