Minimum-cost single-source 2-splittable flow.
Stavros G. KolliopoulosPublished in: Inf. Process. Lett. (2005)
Keyphrases
- single source
- minimum cost
- network flow problem
- shortest path problem
- np hard
- multi source
- network flow
- network simplex algorithm
- spanning tree
- approximation algorithms
- capacity constraints
- minimum cost flow
- computational complexity
- bayesian networks
- traveling salesman problem
- particle swarm optimization
- special case
- edit operations