A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem-Reference-Cited by-同舟云学术

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

Published:2019-07 Issue:1 Volume:276 Page:88-105
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Singh Kavita,Sundar Shyam

Funder

Science and Engineering Research Board – Department of Science & Technology, Government of India

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference28 articles.

1. Min-degree constrained minimum spanning tree problem: New formulation via Miller–Tucker–Zemlin constraints;Akgun;Computers & Operations Research,2010

2. Min-degree constrained minimum spanning tree problem: Complexity, proprieties and formulations;Almeida,2006

3. md-MST is NP-hard for d 3;Almeida;Electronic Notes in Discrete Mathematics,2010

4. A genetic algorithm for the set covering problem;Beasley;European Journal of Operational Research,1996

5. Tuning metaheuristics: A machine learning perspective;Birattari,2005

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

1. A key distribution technique for wireless sensor networks using spanning trees;Expert Systems with Applications;2024-12

2. SEFSD: an effective deployment algorithm for fog computing systems;Journal of Cloud Computing;2023-07-15

3. An evolutionary approach for obnoxious cooperative maximum covering location problem;Applied Intelligence;2022-03-24

4. Two approaches for the min-degree constrained minimum spanning tree problem;Applied Soft Computing;2021-11

5. Online time-optimal path and trajectory planning for robotic multipoint assembly;Assembly Automation;2021-08-09