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: CoRR (2015)
Keyphrases
- network flow problem
- network design problem
- fixed charge
- branch and bound
- optimal solution
- mixed integer programming
- network design
- benders decomposition
- minimum cost
- fixed cost
- lagrangian relaxation
- approximation algorithms
- minimal cost
- mixed integer
- search algorithm
- column generation
- dynamic programming
- valid inequalities
- branch and bound algorithm
- feasible solution
- network flow
- combinatorial optimization
- lower bound
- transportation networks
- np hard
- lot sizing
- worst case
- transportation problem
- integer programming
- linear programming
- search space
- objective function
- upper bound
- infinite horizon
- total cost
- neural network
- linear program
- constraint satisfaction
- tabu search