"On generating Pareto optimal set in bi-objective reliable network topo" by Basima Elshqeirat, Ahmad Aloqaily et al.
This paper considers an NP-hard network topology design (NTD) problem called NTD-CB/R. A key challenge when solving the bi-objective optimisation problem is to simultaneously minimise cost while maximising bandwidth. This paper aims to generate the best set of non-dominated feasible topologies, known as the Pareto Optimal Set (POS). It formally defines a dynamic programming (DP) formulation for NTD-CB/R. Then, it proposes two alternative Lagrange relaxations to compute a weight for each link. Th...
Pareto Optimal Set Bi Objective Optimisation Dynamic Programming Agrange Relaxation Network Reliability Pareto Optimal Set
Source: uow.edu.au