Two levels approach based on multifactorial optimization to solve the clustered shortest path tree problem
- 14 October 2020
- journal article
- research article
- Published by Springer Nature in Evolutionary Intelligence
- Vol. 15 (1) , 185-213
Abstract
No abstract availableKeywords
Funding Information
- U.S. Army Combat Capabilities Development Command (W90GQZ-93290007)
This publication has 34 references indexed in Scilit:
- On the clustered Steiner tree problemJournal of Combinatorial Optimization, 2014
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problemComputers & Operations Research, 2013
- An improved approximation algorithm for the clustered traveling salesman problemInformation Processing Letters, 2012
- Edge sets: an effective evolutionary coding of spanning treesIEEE Transactions on Evolutionary Computation, 2003
- Generalized spanning treesEuropean Journal of Operational Research, 2000
- On the generalized minimum spanning tree problemNetworks, 1995
- Tree structured fiber optics MANsIEEE Journal on Selected Areas in Communications, 1988
- Fiber Optic Regional Area Networks in New York and DallasIEEE Journal on Selected Areas in Communications, 1986
- The clustered traveling salesman problemComputers & Operations Research, 1975
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957