An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
From MaRDI portal
Publication:4456074
DOI10.1002/nav.10068zbMath1043.90010OpenAlexW2154918794MaRDI QIDQ4456074
H. Edwin Romeijn, Dolores Romero Morales
Publication date: 15 March 2004
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10068
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
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
Uses Software
Cites Work
This page was built for publication: An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
