An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
From MaRDI portal
Publication:4456074
DOI10.1002/NAV.10068zbMATH Open1043.90010OpenAlexW2154918794MaRDI QIDQ4456074FDOQ4456074
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
Recommendations
- Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
- scientific article; zbMATH DE number 1816803
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- 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
- On solving the multi-period single-sourcing problem under uncertainty
- Heuristic methods for the single-machine scheduling problem with periodical resource constraints
- Heuristics for the multi-resource generalized assignment problem
- Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
Cited In (5)
- Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case
- 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
Uses Software
This page was built for publication: An asymptotically optimal greedy heuristic for the multiperiod single-sourcing problem: The cyclic case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4456074)
