Heuristic Search for the Generalized Minimum Spanning Tree Problem
From MaRDI portal
Publication:2890473
DOI10.1287/ijoc.1040.0077zbMath1239.90099OpenAlexW2165842651MaRDI QIDQ2890473
Bruce L. Golden, Daliborka Stanojević, S. Raghu Raghavan
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ac6cb0b6ddc6ad8e558b467fc879bd6ffea20e9e
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A two-level metaheuristic for the all colors shortest path problem ⋮ Generalized minimum spanning tree games ⋮ Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints ⋮ Approximation Algorithms for Generalized MST and TSP in Grid Clusters ⋮ Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem ⋮ A two-level solution approach for solving the generalized minimum spanning tree problem ⋮ An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search ⋮ Continuous approximation formulas for location problems ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ A tabu search heuristic for the generalized minimum spanning tree problem ⋮ Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem ⋮ The prize-collecting generalized minimum spanning tree problem ⋮ A rapid learning automata-based approach for generalized minimum spanning tree problem ⋮ The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ Truncated incremental search
