A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow.
Pedro Henrique González SilvaLuidi Gelabert SimonettiCarlos Alberto de Jesus MartinhonEdcarllos SantosPhilippe Yves Paul MichelonPublished in: ICORES (Selected Papers) (2014)
Keyphrases
- network flow problem
- network design problem
- minimum cost
- approximation algorithms
- network design
- minimal cost
- network flow
- branch and bound
- mixed integer programming
- mixed integer
- worst case
- optimal solution
- np hard
- lagrangian relaxation
- integer programming
- dynamic programming
- valid inequalities
- transportation networks
- moving objects
- exact solution
- network architecture
- optimal control
- branch and bound algorithm
- supply chain