An algorithm for finding the optimum solution of solid fixed-charge transportation problem

DOI10.1080/02331939408844023zbMath0819.90059OpenAlexW2001571342MaRDI QIDQ4764850

No author found.

Publication date: 5 September 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408844023

zbMATH Keywords

solid fixed-charge transportation problem

Mathematics Subject Classification ID

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

Related Items (1)

The multi-objective multi-item just-in-time transportation problem

Cites Work

• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• A vertex ranking algorithm for the fixed-charge transportation problem
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem

This page was built for publication: An algorithm for finding the optimum solution of solid fixed-charge transportation problem