-edge-connected 3-hop-constrained network design problem.
I. DiarrassoubaVirginie GabrelAli Ridha MahjoubLuis Eduardo Neves GouveiaPierre PesneauPublished in: Networks (2016)
Keyphrases
- network design problem
- approximation algorithms
- network design
- mixed integer programming
- benders decomposition
- transportation networks
- branch and bound
- minimal cost
- integer programming
- mixed integer
- lagrangian relaxation
- valid inequalities
- neural network
- production planning
- traveling salesman problem
- tabu search
- worst case
- search algorithm