Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs.

Max Klimm Philipp Warode

Published in: Math. Oper. Res. (2022)

Keyphrases

minimum cost
np hard
network flow
spanning tree
network flow problem
approximation algorithms
computational complexity
pairwise
network simplex algorithm
capacity constraints
objective function
total cost
minimum cost flow
scheduling problem
minimal cost
edit operations