Heuristic Search for the Generalized Minimum Spanning Tree Problem-Reference-Cited by-同舟云学术

Heuristic Search for the Generalized Minimum Spanning Tree Problem

Published:2005-08 Issue:3 Volume:17 Page:290-304
ISSN:1091-9856
Container-title:INFORMS Journal on Computing
language:en
Short-container-title:INFORMS Journal on Computing

Author:

Golden Bruce,Raghavan S.,Stanojević Daliborka

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

General Engineering

Link

https://pubsonline.informs.org/doi/pdf/10.1287/ijoc.1040.0077

Reference14 articles.

1. Generalized spanning trees

2. Feremans C.Generalized Spanning Trees and Extensions(2001) . Ph.D. thesis, Institut de Statistique et de Recherche Opérationnelle, Université Libre de Bruxelles, Bruxelles, Belgium

3. A comparative analysis of several formulations for the generalized minimum spanning tree problem

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

1. Continuous approximation formulas for location problems;Networks;2022-04-29

2. An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search;International Transactions in Operational Research;2020-10-02

3. A rapid learning automata-based approach for generalized minimum spanning tree problem;Journal of Combinatorial Optimization;2020-06-13

4. The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances;European Journal of Operational Research;2020-05

5. A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem;International Transactions in Operational Research;2019-09-30