Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem

DOI10.1007/s10732-007-9047-xzbMath1211.90309OpenAlexW2163148176WikidataQ57705378 ScholiaQ57705378MaRDI QIDQ953318

Günther R. Raidl, Markus Leitner, Bin Hu

Publication date: 17 November 2008

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-007-9047-x

zbMATH Keywords

dynamic programminginteger linear programmingvariable neighborhood searchgeneralized minimum spanning tree

Mathematics Subject Classification ID

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

Related Items (16)

A two-level metaheuristic for the all colors shortest path problem ⋮ Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems ⋮ A hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem ⋮ 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 ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ An effective two‐level solution approach for the prize‐collecting generalized minimum spanning tree problem by iterated local search ⋮ The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm ⋮ A tabu search heuristic for the generalized minimum spanning tree problem ⋮ A reactive GRASP with path relinking for capacitated clustering ⋮ Hybrid adaptive large neighborhood search for the optimal statistic median problem ⋮ Variable neighbourhood search: methods and applications ⋮ 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 ⋮ Variable neighbourhood search: Methods and applications

Uses Software

• POPMUSIC

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• The geometric generalized minimum spanning tree problem with grid clustering
• Class Steiner trees and VLSI-design
• Solving group Steiner problems as Steiner problems.
• Generalized spanning trees
• A comparative analysis of several formulations for the generalized minimum spanning tree problem
• Heuristic Search for the Generalized Minimum Spanning Tree Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
• On the generalized minimum spanning tree problem
• On generalized minimum spanning trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem