Computational study of the multiechelon production planning problem
From MaRDI portal
Publication:4346863
DOI<1::AID-NAV1>3.0.CO;2-E 10.1002/(SICI)1520-6750(199702)44:1<1::AID-NAV1>3.0.CO;2-EzbMath0882.90058OpenAlexW2019091296MaRDI QIDQ4346863
No author found.
Publication date: 5 August 1997
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199702)44:1<1::aid-nav1>3.0.co;2-e
Lagrangean relaxationbranch and boundbranch and cutmulticommodity flow problemsmultiechelon production planning
Production models (90B30) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)
Related Items
Optimal production plans and shipment schedules in a supply-chain system with multiple suppliers and multiple buyers ⋮ Finite horizon planning with fixed-interval deliveries and no shortage
This page was built for publication: Computational study of the multiechelon production planning problem
