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

DOI10.1023/B:HEUR.0000019984.80186.48MaRDI QIDQ1826488zbMATH OpenOpenAlexFDO

Authors 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 optimalitydynamic assignment problemsgreedy heuristicintegrated productioninventory and transportation planning

Mathematics Subject Classification ID

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

Recommendations

• An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
• scientific article; zbMATH DE number 1816803
• A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
• A probabilistic analysis of the multi-period single-sourcing problem
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem

Cited in

(6)

• A heuristic approach to the multi-period single-sourcing problem with production and inventory capacities and perishability constraints
• scientific article; zbMATH DE number 1816803 (Why is no real title available?)
• An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
• Exact algorithms for integrated facility location and production planning problems
• A probabilistic analysis of the multi-period single-sourcing problem
• Greedy approaches for a class of nonlinear generalized assignment problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826488)