Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs-Reference-Cited by-同舟云学术

Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs

Published:2004 Issue: Volume: Page:458-467
ISSN:0302-9743
Container-title:Experimental and Efficient Algorithms
language:
Short-container-title:

Author:

dos Santos Andréa C.,Lucena Abílio,Ribeiro Celso C.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24838-5_34

Reference11 articles.

1. Achuthan, N.R., Caccetta, L., Caccetta, P.A., Geelen, J.F.: Algorithms for the minimum weight spanning tree with bounded diameter problem. In: Phua, K.H., Wand, C.M., Yeong, W.Y., Leong, T.Y., Loh, H.T., Tan, K.C., Chou, F.S. (eds.) Optimisation Techniques and Applications, vol. 1, pp. 297–304. World Scientific, Singapore (1992)

2. Achuthan, N.R., Caccetta, L., Caccetta, P.A., Geelen, J.F.: Computational methods for the diameter restricted minimum weight spanning tree problem. Australasian Journal of Combinatorics 10, 51–71 (1994)

3. Bookstein, A., Klein, S.T.: Compression of correlated bitvectors. Information Systems 16, 110–118 (2001)

4. Lecture Notes in Computer Science;N. Deo,2000

5. Desrochers, M., Laporte, G.: Improvements and extensions to the Miller-Tucker- Zemlin subtour elimination constraints. Operations Research Letters 10, 27–36 (1991)

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Common-Flow Formulations for the Diameter Constrained Spanning and Steiner Tree Problems;International Series in Operations Research & Management Science;2024

2. Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem;Expert Systems;2020-08

3. Trees and Forests;Handbook of Heuristics;2018

4. Trees and Forests;Handbook of Heuristics;2016

5. New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem;INFORMS Journal on Computing;2015-02