An adaptive large neighbourhood search algorithm for diameter bounded network design problems.
Michele GarraffaDeepak MehtaBarry O'SullivanCemalettin OzturkLuis QuesadaPublished in: J. Heuristics (2021)
Keyphrases
- network design problem
- search algorithm
- branch and bound
- capacitated fixed charge
- network design
- approximation algorithms
- network flow problem
- branch and bound algorithm
- search space
- minimal cost
- column generation
- mixed integer
- transportation networks
- valid inequalities
- combinatorial optimization
- mixed integer programming
- integer programming
- upper bound
- lot sizing
- image sequences
- tabu search
- linear programming
- lower bound
- optimal solution