共 50 条
- [3] A Heuristic for the Bounded Diameter Minimum Spanning Tree Problem [J]. ISMSI 2018: PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS, METAHEURISTICS & SWARM INTELLIGENCE, 2018, : 84 - 88
- [7] Parallel Minimum Spanning Tree Heuristic for the Steiner problem in graphs [J]. 2007 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOLS 1 AND 2, 2007, : 443 - 450
- [8] A hybrid heuristic for the diameter constrained minimum spanning tree problem [J]. Journal of Global Optimization, 2010, 46 : 363 - 381
- [10] A New Heuristic for the Minimum Routing Cost Spanning Tree Problem [J]. ICIT 2008: PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY, 2008, : 9 - 13