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

DOI10.1023/B:HEUR.0000019984.80186.48zbMATH Open1061.90004OpenAlexW2039979525MaRDI QIDQ1826488FDOQ1826488

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

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

zbMATH Keywords

asymptotic optimalitygreedy heuristicintegrated productiondynamic assignment problemsinventory and transportation planning

Mathematics Subject Classification ID

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

Cited In (6)

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

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)