Heuristic search for the generalized minimum spanning tree problem

DOI10.1287/IJOC.1040.0077MaRDI QIDQ2890473zbMATH OpenOpenAlexFDO

Authors Bruce Golden, Daliborka Stanojević, S. 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

zbMATH Keywords

algorithms heuristicslocal search genetic algorithmsnetworks tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Upper and lower bounding strategies for the generalized minimum spanning tree problem
• A tabu search heuristic for the generalized minimum spanning tree problem
• On the generalized minimum spanning tree problem
• scientific article; zbMATH DE number 5036665
• scientific article; zbMATH DE number 5876375

Cited in

(22)

• Truncated incremental search
• scientific article; zbMATH DE number 5036665 (Why is no real title available?)
• An average case analysis of the minimum spanning tree heuristic for the power assignment problem
• A two-level metaheuristic for the all colors shortest path problem
• 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
• Generalized minimum spanning tree games
• A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem
• A rapid learning automata-based approach for generalized minimum spanning tree problem
• The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
• Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
• Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
• Scatter search for the minimum leaf 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
• 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
• Continuous approximation formulas for location problems
• Weight space clustering method: integrating data envelopment analysis with Monte Carlo simulation
• Greedy heuristics for the diameter-constrained minimum spanning tree problem
• The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
• The prize-collecting generalized minimum spanning tree problem

This page was built for publication: Heuristic search for the generalized minimum spanning tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890473)