A variable fixing heuristic with Local Branching for the fixed charge uncapacitated network design problem with user-optimal flow.
Pedro Henrique González SilvaLuidi SimonettiPhilippe MichelonCarlos Alberto de Jesus MartinhonEdcarllos SantosPublished in: Comput. Oper. Res. (2016)
Keyphrases
- network flow problem
- network design problem
- fixed charge
- branch and bound
- optimal solution
- mixed integer programming
- fixed cost
- network design
- benders decomposition
- minimum cost
- lagrangian relaxation
- approximation algorithms
- branch and bound algorithm
- mixed integer
- minimal cost
- column generation
- search algorithm
- combinatorial optimization
- valid inequalities
- dynamic programming
- lower bound
- transportation networks
- np hard
- lot sizing
- network flow
- feasible solution
- upper bound
- worst case
- metaheuristic
- search space
- total cost
- integer programming
- linear programming
- objective function
- cutting plane
- lower and upper bounds
- infinite horizon
- knapsack problem
- traveling salesman problem