Path relinking is an evolutionary approach for solving a diverse array of optimization problems. The NP-complete Steiner tree problem is a fundamental ...
Path relinking is an evolutionary approach for solving a diverse array of optimization problems. The. NP-complete Steiner tree problem is a fundamental.
A Path Relinking Approach for Delay-Constrained Least-Cost ...
dl.acm.org › doi › abs › ICTAI.2007.28
Path relinking is an evolutionary approach for solving a diverse array of optimization problems. The NP-complete Steiner tree problem is a fundamental ...
Nejla Ghaboosi, Abolfazl Toroghi Haghighat: A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem. ICTAI (1) 2007: 383-390.
A Path Relinking Approach for Delay-Constrained Least-Cost Multicast Routing Problem. Ghaboosi, N., Haghigha, A.T. · Details · Contributors · Bibliography ...
... Delay(TOPT)). SSPR-VND is a hybrid scatter search with path relinking algorithm for the DCLC-MRP, where VNDMR is applied as the local search method in it.
Abstract. This paper investigates the first hybrid scatter search and path relinking meta-heuristic for the Delay-. Constrained Least-Cost (DCLC) multicast ...
Ghaboosi N., Haghighat A.T., A path relinking approach for Delay-Constrained Least-Cost. Multicast routing problem, In: 19th International Conference on Tools ...
Ghaboosi, N., Haghighat, A.T.: A path relinking approach for Delay-Constrained. Least-Cost Multicast routing problem. In: 19th International Conference on ...
... path relinking. [34, 35] have been investigated for various multicast routing problems. Hamdan. et al. [23] address the delay and delay-variation constrained ...