A local search heuristic for the Multi-Commodity $k$ -splittable Maximum Flow Problem.
Mette GamstPublished in: Optim. Lett. (2014)
Keyphrases
- multi commodity
- heuristic solution
- optimal solution
- facility location
- network design
- max min
- network design problem
- search algorithm
- lower bound
- tabu search
- feasible solution
- minimal cost
- hill climbing
- knapsack problem
- combinatorial optimization
- exhaustive search
- search space
- simulated annealing
- miller tucker zemlin
- network flow problem
- solution quality
- lagrangian relaxation
- branch and bound
- integer programming
- np hard
- memetic algorithm
- dynamic programming
- genetic algorithm
- search procedure
- constraint satisfaction
- graph cuts
- upper bound