1 |
R. Patterson, E. Rolland, and H. Pirkul, "A Memory Adaptive Reasoning Technique for Solving the Capacitated Minimum Spanning Tree Problem", Journal of Heuristics, Vol. 5, No. 2, pp. 159-180, Jul. 1999, https://doi.org/10.1023/A:1009629727566
DOI
|
2 |
E. G. M. Lacerda and M. F. Medeiros, "An Edge- based Crossover for the Capacitated Minimum Spanning Tree Problem", VII Brazilian Congress on Neural Networks(CBRN), pp. 1-6, 2005, https://doi.org/10.21528/CBRN2005-116
DOI
|
3 |
G. Rego, F. Mathew, and F. Glover, "RAMP for the Capacitated Minimum Spanning Tree Problem", Annals of Operations Research, Vol. 181, No. 1, pp. 661-681, Dec. 2010, https://doi.org/10.1007/ s10479-010-0800-4
DOI
|
4 |
E. Rolland, R. Patterson, and H. Pirkul, "Memory Adaptive Reasoning & Greedy Assignment Techniques for the Capacitated Minimum Spanning Tree Problem", Meta-Heuristics, pp 487-498, 1999, https://doi. org/10.1007/978-1-4615-5775-3_33
DOI
|
5 |
M. Reimann and M. Laumanns, "A Hybrid ACO Algorithm for the Capacitated Minimum Spanning Tree Problem", Proceedings of the 1st International Workshop of Hybrid Mataheuristics, pp. 1-10, Aug. 2004.
|
6 |
G. R. Raidl and C. Drexel, "A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem", Late Breaking Papers at the Genetic and Evolutionary Computation Conference, pp. 309-316, Dec. 2002.
|
7 |
L. Gouveia, "A Comparison of Directed Formulations for the Capacitated Minimal Spanning Tree Problem", Telecommunication Systems, Vol. 1, No. 1, pp. 51-76, Dec. 1993, https://doi.org/10.1007/ BF02136155
DOI
|
8 |
E. Ruiz, M. Albareda-Sambola, E. Fernandez, and M. G. C. Resende, "A Biased Random- Key Genetic Algorithm for the Capacitated Minimum Spanning Tree Problem", Computers & Operations Research, Vol. 57, pp. 95-108, May 2015, https://doi.org/10.1016/j.cor.2014.11. 011
DOI
|
9 |
Y. M. Sharaiha, M. Gendreau, G. Laporte, and I. H. Osman, "A Tabu Search Algorithm for the Capacitated Shortest Spanning Tree Problem", Networks, Vol. 29, No. 3, pp. 161-171, May 1999, https://doi.org/10.1002/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F
DOI
|
10 |
J. E. Beasley, "OR-Library: Capacitated Minimal Spanning Tree", http://people.brunel.ac.uk/~mastjjb/jeb/orlib/capmstinfo.html, Sep. 2004.
|
11 |
R. Jothi and B. Raghavachari, "Revisiting EsauWilliams' Algorithm: On the Design of Local Access Networks", Proceedings of 7th Informs Telecommunications, pp. 104-107, 2004.
|
12 |
L. R. Esau and K. C. Williams, "On Teleprocessing Network Design: Part II. A Method for Approximating the Optimal Network", IBM Systems Journal, Vol. 5, No. 3, pp. 142-147, 1966, https://doi.org/10.1147/sj.53.0142.
DOI
|
13 |
R. Jothi and B. Raghavachari, "Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design", Journal of ACM Transactions on Algorithms, Vol. 1, No. 2, pp. 265-282, Oct. 2005, https://doi.org/10.1145/1103963.1103967
DOI
|
14 |
F. Shinji, "Improving the Esau-Williams Algorithm for Designing Local Access Networks", Bachelor of Science, University of Aizu, Aizu- Wakamatsu, Fukushima, Japan, May 2000.
|
15 |
A. Amberg, W. Domschke, and S. Voss, "Capacitated Minimum Spanning Trees: Algorithms using Intelligent Search", Combinatorial Optimization: Theory and Practice, Vol. 1, pp. 9-39, Aug. 1996.
|
16 |
B. Gavish, "Augmented Lagrangean Based Algorithms for Centralized Network Design", IEEE Transactions on Communications, Vol. COM-33, No. 12, pp. 1247-1257, Dec. 1985, https://doi. org/10.1109/TCOM.1985.1096250
DOI
|
17 |
G. Zhou, Z. Cao, J. Cao, and Z. Meng, "A Genetic Algorithm Approach on Capacitated Minimum Spanning Tree Problem", International Conference on Computational Intelligence and Security, pp. 215-218, Nov. 2006, https://doi. org/10.1109/ICCIAS.2006.294124
DOI
|
18 |
E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. P. Aragao, and D. Andrade, "Robust BranchCut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation", Mathematical Programming, Vol. 112, No. 2, pp. 443-472, Apr. 2008, https://doi.org/10.1007/s10107 -006-0043-y
DOI
|
19 |
M. Kritikos and G. Ioannou, "A Greedy Heuristic for the Capacitated Minimum Spanning Tree Problem", Journal of the Operational Research Society, Vol. 68, No. 10, pp. 1223-1235, Oct. 2017, https://doi.org/10.1057/s41274-016-0146-7
DOI
|