A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note).
Celso C. RibeiroIsabel RossetiPublished in: Euro-Par (2002)
Keyphrases
- network design problem
- capacitated fixed charge
- heuristic solution
- mixed integer programming
- network design
- lagrangian relaxation
- benders decomposition
- lagrangian heuristic
- approximation algorithms
- branch and bound
- tabu search
- minimal cost
- mixed integer
- depth first search
- valid inequalities
- transportation networks
- shortest path
- column generation
- optimal solution
- feasible solution
- search algorithm
- integer programming
- minimum cost
- endpoints
- lp relaxation
- simulated annealing
- communication networks
- branch and bound algorithm
- integer program
- convergence rate
- mathematical model
- random variables
- dynamic programming
- search space
- neural network