Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation

DOI10.1287/trsc.30.4.276zbMath0879.90146OpenAlexW2062556916MaRDI QIDQ4346441

Ilan Hefter, Meir J. Rosenblatt, Yale T. Herer

Publication date: 3 August 1997

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.30.4.276

zbMATH Keywords

lower boundsdomination rulessingle-sink fixed-charge transportation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Production models (90B30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem, Approximation algorithms for hard capacitated \(k\)-facility location problems, Order splitting with multiple capacitated suppliers, Artificial immune system and sheep flock algorithms for two-stage fixed-charge transportation problem, An acquisition policy for a multi-supplier system with a finite-time horizon, A novel reformulation for the single-sink fixed-charge transportation problem, Analysis of interval programming in different environments and its application to fixed-charge transportation problem, Solving fixed charge transportation problem with truck load constraint using metaheuristics, Algorithms for solving the single-sink fixed-charge transportation problem, The bottleneck transportation problem with auxiliary resources, Stochastic optimization models for a single-sink transportation problem, A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach, A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge, Production allocation and shipment policies in a multiple-manufacturer–single-retailer supply chain