scientific article; zbMATH DE number 515927

MaRDI QIDQ4283439zbMATH OpenFDO

Authors Robert G. Bland, David L. Jensen, László Ladányi, Joseph Cheriyan

Publication date 10 March 1994

zbMATH Keywords

minimum cost network flow codes

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10)

Recommendations

• Minimum-cost flow algorithms: an experimental evaluation
• On the computational behavior of a polynomial-time network flow algorithm
• scientific article; zbMATH DE number 5173820
• scientific article; zbMATH DE number 1263274
• An efficient implementation of the network simplex method

Cited in

(13)

• On the computational behavior of a polynomial-time network flow algorithm
• Applying steepest-edge techniques to a network primal-dual algorithm
• On dual minimum cost flow algorithms
• An efficient cost scaling algorithm for the assignment problem
• Designing and reporting on computational experiments with heuristic methods
• A new scaling algorithm for the minimum cost network flow problem
• A computational study of cost reoptimization for min-cost flow problems
• Minimum-cost flow algorithms: an experimental evaluation
• On minimum reload cost paths, tours, and flows
• Performance of Shortest Path Algorithms in Network Flow Problems
• scientific article; zbMATH DE number 515929 (Why is no real title available?)
• scientific article; zbMATH DE number 5663509 (Why is no real title available?)
• A survey on exact algorithms for the maximum flow and minimum‐cost flow problems

Describes a project that uses

Uses Software

• NETGEN
• RELAX4

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4283439)