Single-source k-splittable min-cost flows.
Fernanda SalazarMartin SkutellaPublished in: Oper. Res. Lett. (2009)
Keyphrases
- single source
- min cost
- combinatorial optimization problems
- shortest path problem
- max flow
- network flow
- multi source
- combinatorial optimization
- metaheuristic
- parallel processors
- knapsack problem
- optimization problems
- approximation algorithms
- ant colony optimization
- integer programming
- vehicle routing problem
- energy minimization
- traveling salesman problem
- directed graph
- single processor
- multi objective