Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem

DOI10.1007/S10732-007-9065-8zbMath1180.90022OpenAlexW2013574696MaRDI QIDQ835755

Simon Görtz, Andreas Klose

Publication date: 31 August 2009

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

Full work available at URL: https://doi.org/10.1007/s10732-007-9065-8

zbMATH Keywords

worst-case analysisapproximation algorithmsgreedy algorithmsfixed-charge transportation problemmin-knapsack problem

Mathematics Subject Classification ID

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

Related Items (4)

Approximation algorithms for hard capacitated \(k\)-facility location problems ⋮ A novel reformulation for the single-sink fixed-charge transportation problem ⋮ A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach ⋮ Bandwidth Constrained Multi-interface Networks

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• The concave cost supply problem.
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Algorithms for solving the single-sink fixed-charge transportation problem
• An Algorithm for Large Zero-One Knapsack Problems
• Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation

This page was built for publication: Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem