Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems

DOI10.1057/jors.1991.189zbMath0756.90064OpenAlexW1975394637MaRDI QIDQ3984310

Moustapha Diaby

Publication date: 27 June 1992

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1991.189

zbMATH Keywords

deteriorationheuristic procedureheat lossesfixed-charge transportationresource losses

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

A heuristic algorithm for the fixed charge problem ⋮ Solving fixed charge transportation problem with truck load constraint using metaheuristics ⋮ A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems ⋮ Adaptive dynamic cost updating procedure for solving fixed charge network flow problems ⋮ A genetic algorithm for solving the fixed-charge transportation model: two-stage problem ⋮ Unnamed Item ⋮ A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure

This page was built for publication: Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems