Approximate Parametric Computation of Minimum-Cost Flows with Convex Costs.
Per JoachimsMax KlimmPhilipp WarodePublished in: CoRR (2022)
Keyphrases
- minimum cost
- np hard
- approximation algorithms
- network flow
- spanning tree
- network flow problem
- piecewise linear
- capacity constraints
- network simplex algorithm
- convex optimization
- convex hull
- minimum cost flow
- np complete
- total cost
- integer programming
- expected cost
- special case
- search algorithm
- edit operations
- optimal solution