A (k + 1)-Approximation Robust Network Flow Algorithm and a Tighter Heuristic Method Using Iterative Multiroute Flow.
Jean-François BaffierVorapong SuppakitpaisarnPublished in: WALCOM (2014)
Keyphrases
- network flow
- dynamic programming
- min cost
- cost function
- objective function
- optimization algorithm
- combinatorial optimization
- k means
- computational complexity
- max flow
- optimal solution
- optimization method
- network flow formulation
- energy function
- segmentation algorithm
- linear programming
- simulated annealing
- network flow problem
- randomized algorithm
- np hard
- search space
- constraint satisfaction
- optimization process
- greedy heuristic
- particle swarm optimization
- approximation algorithms
- quadratic programming
- genetic algorithm