A Heuristic Procedure with Local Branching for the Fixed Charge Network Design Problem with User-optimal Flow.
Pedro Henrique González SilvaLuidi Gelabert SimonettiCarlos Alberto de Jesus MartinhonPhilippe Yves Paul MichelonEdcarllos SantosPublished in: ICEIS (1) (2014)
Keyphrases
- network flow problem
- network design problem
- branch and bound
- optimal solution
- minimum cost
- mixed integer programming
- lagrangian relaxation
- approximation algorithms
- minimal cost
- network design
- branch and bound algorithm
- search algorithm
- np hard
- mixed integer
- valid inequalities
- lower bound
- network flow
- dynamic programming
- transportation networks
- column generation
- worst case
- feasible solution
- combinatorial optimization
- fixed cost
- search space
- knapsack problem
- upper bound
- integer programming
- capacity expansion
- integer program
- neural network
- communication networks
- tabu search
- simulated annealing