Lower and upper bounds for the degree-constrained minimum spanning tree problem-Reference-Cited by-同舟云学术

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

Published:2007 Issue:1 Volume:50 Page:55-66
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

da Cunha Alexandre Salles,Lucena Abilio

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference52 articles.

1. Using Lagrangian dual information to generate degree constrained spanning trees

2. , A relax and cut algorithm for the traveling salesman problem, 17th International Symposium on Mathematical Programming, Atlanta, USA, 2000, pp. 77.

3. , “A Lagrangian heuristic for the linear ordering problem”, Metaheuristics: Computer decision-making, (Editors), Kluwer Academic, Boston, 2003, pp. 123–151.

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

5. Optimal rectangular partitions

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

1. NeuroPrim: An attention-based model for solving NP-hard spanning tree problems;Science China Mathematics;2024-02-22

2. Design of capacitated degree constrained min-sum arborescence;OPSEARCH;2022-06-27

3. Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2020

4. Exact solution approaches for the Multi-period Degree Constrained Minimum Spanning Tree Problem;European Journal of Operational Research;2018-11

5. Trees and Forests;Handbook of Heuristics;2018