network simplex algorithm
Description: The network simplex algorithm is a graph-theoretic optimization method for solving minimum-cost flow problems on networks.
Primary topic: Complexity and Algorithms in Graphs (63%)
Related topic: Complexity and Algorithms in Graphs (63%)
Wikidata ID: wiki/Q1978970
OpenAlex ID: keywords/network-simplex-algorithm
