메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 11-18

An ant-based algorithm for finding degree-constrained minimum spanning tree

Author keywords

Ant Algorithm; Degree Constrained Spanning Tree

Indexed keywords

ALGORITHMS; COSTS; TREES (MATHEMATICS);

EID: 33750225376     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144000     Document Type: Conference Paper
Times cited : (46)

References (24)
  • 1
    • 0030103806 scopus 로고    scopus 로고
    • Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
    • Boldon, B., N. Deo, and N. Kumar, "Minimum-Weight Degree-Constrained Spanning Tree Problem: Heuristics and Implementation on an SIMD Parallel Machine," Parallel Computing, 22, 1996, pp. 369-382.
    • (1996) Parallel Computing , vol.22 , pp. 369-382
    • Boldon, B.1    Deo, N.2    Kumar, N.3
  • 2
    • 0001460554 scopus 로고    scopus 로고
    • Genetic algorithm and graph partitioning
    • July
    • Bui, T. N. and B. R. Moon, "Genetic Algorithm and Graph Partitioning," IEEE Trans. on Computers, 45(7), July 1996, pp. 841-855.
    • (1996) IEEE Trans. on Computers , vol.45 , Issue.7 , pp. 841-855
    • Bui, T.N.1    Moon, B.R.2
  • 7
    • 0033084695 scopus 로고    scopus 로고
    • Ant algorithms for discrete optimization
    • Dorigo, M., G. D. Caro, and L. M. Gambardella, "Ant Algorithms for Discrete Optimization," Artificial Life, 5, 1999, pp. 137-172.
    • (1999) Artificial Life , vol.5 , pp. 137-172
    • Dorigo, M.1    Caro, G.D.2    Gambardella, L.M.3
  • 10
    • 0034225435 scopus 로고    scopus 로고
    • A new evolutionary approach to the degree-constrained minimum spanning tree problem
    • Knowles, J. and D. Corne, "A New Evolutionary Approach to the Degree-Constrained Minimum Spanning Tree Problem," IEEE Trans. On Evolutionary Computation, 4(2), 2000, pp. 125-134.
    • (2000) IEEE Trans. on Evolutionary Computation , vol.4 , Issue.2 , pp. 125-134
    • Knowles, J.1    Corne, D.2
  • 11
    • 0035504990 scopus 로고    scopus 로고
    • Comparison of algorithms for the degree constrained minimum spanning tree
    • Krishnamoorthy, M., A. T. Ernst, and Y. M. Sharaiha, "Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree," Journal of Heuristics, 7, 2001, pp. 587-611.
    • (2001) Journal of Heuristics , vol.7 , pp. 587-611
    • Krishnamoorthy, M.1    Ernst, A.T.2    Sharaiha, Y.M.3
  • 13
    • 0033671532 scopus 로고    scopus 로고
    • An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem
    • Raidl, G. R., "An Efficient Evolutionary Algorithm for the Degree-Constrained Minimum Spanning Tree Problem," Proc. IEEE CEC, 2000, pp. 104-111.
    • (2000) Proc. IEEE CEC , pp. 104-111
    • Raidl, G.R.1
  • 14
    • 84897423628 scopus 로고    scopus 로고
    • A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
    • Raidl, G. R. and B. A. Julstrom, "A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem," Proc. 2000 ACM Symposium on Applied Computing, 2000, pp. 440-445.
    • (2000) Proc. 2000 ACM Symposium on Applied Computing , pp. 440-445
    • Raidl, G.R.1    Julstrom, B.A.2
  • 15
    • 0038479945 scopus 로고    scopus 로고
    • Edge-sets: An effective evolutionary coding of spanning trees
    • Raidl, G. R. and B. A. Julstrom, "Edge-Sets: An Effective Evolutionary Coding of Spanning Trees.," IEEE Trans. On Evolutionary Computation, 7(3), 2003, pp. 225-239.
    • (2003) IEEE Trans. on Evolutionary Computation , vol.7 , Issue.3 , pp. 225-239
    • Raidl, G.R.1    Julstrom, B.A.2
  • 17
    • 27344450686 scopus 로고    scopus 로고
    • A hybrid ACO algorithm for the capacitated minimum spanning tree problem
    • Reimann, M. and M. Laumanns, "A Hybrid ACO Algorithm for the Capacitated Minimum Spanning Tree Problem," Hybrid Metaheurustucs, 2004, pp. 1-10.
    • (2004) Hybrid Metaheurustucs , pp. 1-10
    • Reimann, M.1    Laumanns, M.2
  • 18
    • 0021818903 scopus 로고
    • Edge exchanges in the degree-constrained minimum spanning tree problem
    • Savelsbergh, M. and T. Volgenant, "Edge Exchanges in the Degree-Constrained Minimum Spanning Tree Problem," Computers and Operations Research, 12(4), 1985, pp. 341-348.
    • (1985) Computers and Operations Research , vol.12 , Issue.4 , pp. 341-348
    • Savelsbergh, M.1    Volgenant, T.2
  • 20
    • 24344444753 scopus 로고    scopus 로고
    • A powerful new encoding for tree-based combinatorial optimization problems
    • Soak, S., D. Corne, and B. Ahn, "A Powerful New Encoding for Tree-Based Combinatorial Optimization Problems," Lecture Notes in Computer Science, 3242, 2004, pp. 430-439.
    • (2004) Lecture Notes in Computer Science , vol.3242 , pp. 430-439
    • Soak, S.1    Corne, D.2    Ahn, B.3
  • 22
    • 0038241281 scopus 로고    scopus 로고
    • Swarm intelligence: Power in numbers
    • August
    • Tarasewich, P. and P. R. McMullen, "Swarm Intelligence: Power in Numbers," Communications of the ACM, 45(8), August 2002, pp. 62-67.
    • (2002) Communications of the ACM , vol.45 , Issue.8 , pp. 62-67
    • Tarasewich, P.1    McMullen, P.R.2
  • 23
    • 0024641470 scopus 로고
    • A lagrangean approach to the degree-constrained minimum spanning tree problem
    • Volgenant, A., "A Lagrangean Approach to the Degree-Constrained Minimum Spanning Tree Problem," European Journal of Operational Research, 39, 1989, pp. 325-331.
    • (1989) European Journal of Operational Research , vol.39 , pp. 325-331
    • Volgenant, A.1
  • 24
    • 0039054277 scopus 로고    scopus 로고
    • A note on genetic algorithms for degree-constrained spanning tree problems
    • Zhou, G. and M. Gen, "A Note on Genetic Algorithms for Degree-Constrained Spanning Tree Problems," Networks, 30, 1997, 91-95.
    • (1997) Networks , vol.30 , pp. 91-95
    • Zhou, G.1    Gen, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.