A Simple Algorithm for Solving Small, Fixed-Charge Transportation Problems
From MaRDI portal
Recommendations
- An algorithm for solving the transportation problem
- Heuristic algorithms for the fixed-charge transportation problem
- scientific article; zbMATH DE number 4112384
- Algorithms for solving the single-sink fixed-charge transportation problem
- scientific article; zbMATH DE number 4095208
- Fast heuristic algorithms to solve a single-stage fixed-charge transportation problem
- A new algorithm for optimal solution of fixed charge transportation problem
- scientific article; zbMATH DE number 1070402
- A new algorithm for transportation problem
Cited in
(10)- Fast heuristic algorithms to solve a single-stage fixed-charge transportation problem
- A genetic algorithm for solving the fixed-charge transportation model: two-stage problem
- A heuristic algorithm for the fixed charge problem
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation
- scientific article; zbMATH DE number 614356 (Why is no real title available?)
- Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation
- An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem
- scientific article; zbMATH DE number 2099374 (Why is no real title available?)
- Maximum difference extreme difference method for finding the initial basic feasible solution of transportation problems
- A simple greedy algorithm for a class of shuttle transportation problems
This page was built for publication: A Simple Algorithm for Solving Small, Fixed-Charge Transportation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3812035)
