Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case

DOI10.1023/B:HEUR.0000019984.80186.48zbMath1061.90004OpenAlexW2039979525MaRDI QIDQ1826488

H. Edwin Romeijn, Dolores Romero Morales

Publication date: 6 August 2004

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:heur.0000019984.80186.48

zbMATH Keywords

asymptotic optimalitygreedy heuristicintegrated productiondynamic assignment problemsinventory and transportation planning

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (3)

Greedy approaches for a class of nonlinear generalized assignment problems ⋮ A probabilistic analysis of the multi-period single-sourcing problem ⋮ Exact algorithms for integrated facility location and production planning problems

This page was built for publication: Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case