Solving the undirected minimum cost flow problem with arbitrary costs

DOI10.1002/net.20042zbMath1061.68016OpenAlexW4233329165MaRDI QIDQ4651934

No author found.

Publication date: 23 February 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20042

zbMATH Keywords

network flowsundirected minimum cost flow problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (1)

Preemptive benchmarking problem: An approach for official statistics in small areas

Cites Work

• Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving the undirected minimum cost flow problem with arbitrary costs