Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms-Reference-Cited by-同舟云学术

Efficient lower and upper bounds for the weight-constrained minimum spanning tree problem using simple Lagrangian based algorithms

Published:2018-09-19 Issue:4 Volume:20 Page:2467-2495
ISSN:1109-2858
Container-title:Operational Research
language:en
Short-container-title:Oper Res Int J

Author:

Requejo Cristina^ORCID,Santos Eulália^ORCID

Funder

FCT - Portuguese Foundation for Science and Technology

Publisher

Springer Science and Business Media LLC

Subject

Management of Technology and Innovation,Computational Theory and Mathematics,Management Science and Operations Research,Statistics, Probability and Uncertainty,Strategy and Management,Modeling and Simulation,Numerical Analysis

Link

http://link.springer.com/content/pdf/10.1007/s12351-018-0426-x.pdf

Reference33 articles.

1. Aggarwal V, Aneja YP, Nair KPK (1982) Minimal spanning tree subject to a side constraint. Comput Oper Res 9:287–296

2. Agra A, Cerveira A, Requejo C, Santos E (2011) On the weight-constrained minimum spanning tree problem. In: Proceedings of the international network optimization conference, volume 6701 of lecture notes in computer science, pp 156–161

3. Agra A, Requejo C, Santos E (2016) Implicit cover inequalities. J Comb Optim 31(3):1111–1129

4. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice-Hall, Upper Saddle River

5. Amado L, Bárcia P (1996) New polynomial bounds for matroidal knapsacks. Eur J Oper Res 95:201–210

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

1. Minimum Spanning Tree Method for Sparse Graphs;Mathematical Problems in Engineering;2023-02-21