Tree-based access network design under requirements for an aggregation network
暂无分享,去创建一个
[1] Luís Gouveia,et al. Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints , 1995, Comput. Oper. Res..
[2] L. Gouveia. Multicommodity flow models for spanning trees with hop constraints , 1996 .
[3] Deep Medhi,et al. Routing, flow, and capacity design in communication and computer networks , 2004 .
[4] Ben Paechter,et al. Parallelization of population-based multi-objective meta-heuristics: An empirical study , 2006 .
[5] Reza Tavakkoli-Moghaddam,et al. A multi-objective scatter search for a mixed-model assembly line sequencing problem , 2007, Adv. Eng. Informatics.
[6] Alexandre Salles da Cunha,et al. Algorithms for the degree-constrained minimum spanning tree problem , 2005, Electron. Notes Discret. Math..
[7] Daniel G. Brown,et al. Knowledge-informed Pareto simulated annealing for multi-objective spatial allocation , 2007, Comput. Environ. Urban Syst..