Min-degree constrained minimum spanning tree problem: New formulation via Miller–Tucker–Zemlin constraints-Reference-Cited by-同舟云学术

Min-degree constrained minimum spanning tree problem: New formulation via Miller–Tucker–Zemlin constraints

Published:2010-01 Issue:1 Volume:37 Page:72-82
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Akgün İbrahim,Tansel Barbaros Ç.

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference27 articles.

1. Network flows;Ahuja,1993

2. The Irwin handbook of telecommunications;James,2006

3. On the shortest spanning subtree of a graph and the traveling salesman problem;Kruskal;Proceedings of the American Mathematics Society,1956

4. Shortest connection networks and some generalizations;Prim;Bell System Technical Journal,1957

5. Almeida AM, Martins P, Souza MC. Min-degree constrained minimum spanning tree problem: complexity, proprieties, and formulations. Working paper, 2006 〈http://cio.fc.ul.pt/files/6.2006.pdf〉.

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

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

2. A unifying model for locally constrained spanning tree problems;Journal of Combinatorial Optimization;2021-04-19

3. The Generalized Dependency Constrained Spanning Tree Problem;Electronic Notes in Theoretical Computer Science;2019-08

4. A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem;European Journal of Operational Research;2019-07

5. An exact and heuristic approach for the d-minimum branch vertices problem;Computational Optimization and Applications;2018-08-21