📚 DCMST References Database

Degree-constrained minimum spanning tree

Narula, S. C., & Ho, C. A. (1980)

Computers & Operations Research 7(4) : 239-249

DOI: 10.1016/0305-0548(80)90022-2

Computers and intractability: A guide to the theory of NP-completeness

Garey, M. R., & Johnson, D. S. (1979)

W. H. Freeman (Book)

Edge exchanges in the degree-constrained minimum spanning tree problem

Savelsbergh, M. W. P., & Volgenant, T. (1985)

Computers & Operations Research 12(4) : 341-348

DOI: 10.1016/0305-0548(85)90032-7

A Lagrangean approach to the degree-constrained minimum spanning tree problem

Volgenant, A. (1989)

European Journal of Operational Research 39(3) : 325-331

DOI: 10.1016/0377-2217(89)90168-6

Comparison of algorithms for the degree constrained minimum spanning tree

Krishnamoorthy, M., Ernst, A. T., & Sharaiha, Y. M. (2001)

Journal of Heuristics 7(6) : 587-611

DOI: 10.1023/A:1011977126230

A note on genetic algorithms for degree-constrained spanning tree problems

Zhou, G., & Gen, M. (1997)

Networks 30(2) : 91-95

DOI: 10.1002/(SICI)1097-0037(199709)30:2<91::AID-NET3>3.0.CO;2-G

An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem

Raidl, G. R. (2000)

IEEE Congress on Evolutionary Computation : 104-111

DOI: 10.1109/CEC.2000.870282

Edge sets: An effective evolutionary coding of spanning trees

Raidl, G. R., & Julstrom, B. A. (2003)

IEEE Transactions on Evolutionary Computation 7(3) : 225-239

DOI: 10.1109/TEVC.2002.807275

Variable neighborhood search for the degree-constrained minimum spanning tree problem

Ribeiro, C. C., & Souza, M. C. (2002)

Discrete Applied Mathematics 118(1-2) : 43-54

DOI: 10.1016/S0166-218X(01)00255-4

Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine

Boldon, B., Deo, N., & Kumar, N. (1996)

Parallel Computing 22(3) : 369-382

DOI: 10.1016/0167-8191(95)00062-3

An improved ant-based algorithm for the degree-constrained minimum spanning tree problem

Bui, T. N., Deng, X., & Zrncic, C. M. (2012)

IEEE Transactions on Evolutionary Computation 16(2) : 266-278

DOI: 10.1109/TEVC.2011.2125971

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

Bui, T. N., & Zrncic, C. M. (2006)

GECCO Conference : 11-18

DOI: 10.1145/1143997.1144000

New particle swarm optimization algorithm for solving degree constrained minimum spanning tree problem

Binh, H. T. T., & Nguyen, T. B. (2008)

PRICAI 2008 (LNCS 5351) : 1077-1085

DOI: 10.1007/978-3-540-89197-0_110

A hybrid Lagrangian particle swarm optimization algorithm for the degree-constrained minimum spanning tree problem

Ernst, A. T. (2010)

IEEE Congress on Evolutionary Computation : 1-8

DOI: 10.1109/CEC.2010.5585939

Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm

Sun, Y., Li, J., & Chen, S. (2015)

Mathematical Problems in Engineering 2015 : Article 601782

DOI: 10.1155/2015/601782

A branch and cut method for the degree-constrained minimum spanning tree problem

Caccetta, L., & Hill, S. P. (2001)

Networks 37(2) : 74-83

DOI: 10.1002/1097-0037(200103)37:2<74::AID-NET1>3.0.CO;2-V

Lower and upper bounds for the degree-constrained minimum spanning tree problem

da Cunha, A. S., & Lucena, A. (2007)

Networks 50(1) : 55-66

DOI: 10.1002/net.20166

Using Lagrangian dual information to generate degree constrained spanning trees

Andrade, R., Lucena, A., & Maculan, N. (2006)

Discrete Applied Mathematics 154(5) : 703-717

DOI: 10.1016/j.dam.2005.06.011

Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem

Bicalho, L. H., da Cunha, A. S., & Lucena, A. (2016)

Computational Optimization and Applications 63(3) : 755-792

DOI: 10.1007/s10589-015-9788-7

A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem

Sundar, S., & Singh, A. (2019)

Soft Computing 24(3) : 2169-2186

DOI: 10.1007/s00500-019-04051-x

Two approaches for the min-degree constrained minimum spanning tree problem

Ghoshal, S., & Sundar, S. (2021)

Applied Soft Computing 108 : Article 107445

DOI: 10.1016/j.asoc.2021.107445

A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem

Singh, A., & Sundar, S. (2019)

European Journal of Operational Research 275(3) : 1007-1018

DOI: 10.1016/j.ejor.2019.01.008

Degree-constrained k-minimum spanning tree problem

Adasme, P., Andrade, R., Dehghan, M., & Lisser, A. (2020)

Complexity 2020 : Article 7628105

DOI: 10.1155/2020/7628105

A new algorithm for degree-constrained minimum spanning tree based on the reduction technique

Ning, A., Ma, L., & Xiong, X. (2008)

Progress in Natural Science 18(4) : 495-499

DOI: 10.1016/j.pnsc.2007.10.005

Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem

de Souza, M. C., & Martins, P. (2008)

European Journal of Operational Research 191(3) : 677-690

DOI: 10.1016/j.ejor.2006.12.064

A primal branch-and-cut algorithm for the degree-constrained minimum spanning tree problem

Behle, M., Jünger, M., & Liers, F. (2007)

Experimental Algorithms (LNCS 4525) : 379-392

DOI: 10.1007/978-3-540-72845-0_30

Degree constrained minimum spanning tree problem: A learning automata approach

Gholami, M., & Sohrabi, M. K. (2013)

The Journal of Supercomputing 64(1) : 226-249

DOI: 10.1007/s11227-012-0851-1

The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm

Martinez, L. C., & Cunha, A. S. (2012)

Discrete Applied Mathematics 164(1) : 210-224

DOI: 10.1016/j.dam.2011.08.020

New genetic algorithm approach for the min-degree constrained minimum spanning tree

Salgueiro, R., Almeida, F., & Oliveira, B. (2017)

European Journal of Operational Research 261(3) : 849-861

DOI: 10.1016/j.ejor.2016.11.016

Solving the degree constrained minimum spanning tree problem using tabu and modified penalty search methods

Wamiliana (2004)

Jurnal Teknik Industri 6(1) : 1-9

DOI: 10.9744/jti.6.1.1-9

Heuristics approach for the degree constrained minimum spanning tree

Caccetta, L., & Wamiliana (2001)

International Modelling and Simulation Conference : 2161-2166

Particle swarm optimization for the bi-objective degree constrained minimum spanning tree

Goldbarg, E. F. G., de Souza, G. R., & Goldbarg, M. C. (2006)

IEEE Congress on Evolutionary Computation : 420-427

DOI: 10.1109/CEC.2006.1688341

Particle swarm optimization for the degree-constrained MST problem in WSN topology control

Guo, W. Z., Gao, H. L., Chen, G. L., & Yu, L. (2009)

International Conference on Machine Learning and Cybernetics : 1793-1798

DOI: 10.1109/ICMLC.2009.5212257

Relations, models and a memetic approach for three degree-dependent spanning tree problems

Cerrone, C., Cerulli, R., & Raiconi, A. (2014)

European Journal of Operational Research 232(3) : 442-453

DOI: 10.1016/j.ejor.2013.07.035

Degree-constrained minimum spanning tree problem of uncertain random network

Gao, X., Jia, L., & Kar, S. (2017)

Journal of Ambient Intelligence and Humanized Computing 8(5) : 747-757

DOI: 10.1007/s12652-017-0519-9

Comparison of heuristic algorithms for the degree constrained minimum spanning tree

Craig, G., Krishnamoorthy, M., & Palaniswami, M. (1996)

Metaheuristics: Theory and Applications (Kluwer) : 83-96

A new evolutionary approach to the degree-constrained minimum spanning tree problem

Knowles, J., & Corne, D. (2000)

IEEE Transactions on Evolutionary Computation 4(2) : 125-134

DOI: 10.1109/4235.850653

Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds

Andrade, R. C., & Freitas, A. T. (2013)

Electronic Notes in Discrete Mathematics 41 : 5-12

DOI: 10.1016/j.endm.2013.05.069

Minimum spanning trees made easier via multi-objective optimization

Neumann, F., & Wegener, I. (2006)

Natural Computing 5(3) : 305-319

DOI: 10.1007/s11047-006-9004-x

Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem

Kawatra, R. (2018)

European Journal of Operational Research 268(3) : 802-815

DOI: 10.1016/j.ejor.2018.04.039