Heuristic algorithms for the fixed-charge transportation problem

DOI10.1007/BF03398770zbMath1153.90325OpenAlexW2300633506MaRDI QIDQ998695

J. Martínez

Publication date: 9 February 2009

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398770

zbMATH Keywords

integer programmingheuristic algorithmsfixed charge transportation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (6)

On multi-index fixed charge bi-criterion transportation problem ⋮ On lower bounds for the fixed charge problem ⋮ Solving a fuzzy fixed charge solid transportation problem using batch transferring by new approaches in meta-heuristic ⋮ A heuristic algorithm for the fixed charge problem ⋮ A heuristic for obtaining better initial feasible solution to the transportation problem ⋮ Fractional polynomial bounds for the fixed charge problem

Cites Work

• A vertex ranking algorithm for the fixed-charge transportation problem
• Fixed-cost transportation problems
• The fixed charge problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points

This page was built for publication: Heuristic algorithms for the fixed-charge transportation problem