A Pareto frontier for node survivable computer network design problem.
Ali HadianMehri BagherianPublished in: Telecommun. Syst. (2021)
Keyphrases
- network design problem
- network design
- approximation algorithms
- branch and bound
- minimal cost
- pareto frontier
- transportation networks
- mixed integer programming
- integer programming
- multi objective
- bi objective
- mixed integer
- multi objective optimization
- optimal solution
- genetic algorithm
- lagrangian relaxation
- valid inequalities
- multiobjective optimization
- directed graph
- upper bound
- metaheuristic
- np hard