Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem
DOI10.1007/S10732-007-9047-XzbMATH Open1211.90309DBLPjournals/heuristics/HuLR08OpenAlexW2163148176WikidataQ57705378 ScholiaQ57705378MaRDI QIDQ953318FDOQ953318
Authors: Bin Hu, Markus Leitner, Günther R. Raidl 
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
Recommendations
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Relaxation methods for the Generalized Minimum Spanning Tree problem
- New models of the generalized minimum spanning tree problem
- scientific article; zbMATH DE number 5621997
- A tabu search heuristic for the generalized minimum spanning tree problem
dynamic programminginteger linear programmingvariable neighborhood searchgeneralized minimum spanning tree
Linear programming (90C05) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- POPMUSIC -- partial optimization metaheuristic under special intensification conditions
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Heuristic search for the generalized minimum spanning tree problem
- Class Steiner trees and VLSI-design
- Generalized spanning trees
- A comparative analysis of several formulations for the generalized minimum spanning tree problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- On the generalized minimum spanning tree problem
- Title not available (Why is that?)
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- On generalized minimum spanning trees
- Title not available (Why is that?)
- The geometric generalized minimum spanning tree problem with grid clustering
- Solving group Steiner problems as Steiner problems.
Cited In (18)
- A two-level metaheuristic for the all colors shortest path problem
- Variable neighbourhood search: Methods and applications
- Title not available (Why is that?)
- Variable neighbourhood search: methods and applications
- A rapid learning automata-based approach for generalized minimum spanning tree problem
- Hybrid adaptive large neighborhood search for the optimal statistic median problem
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- A reactive GRASP with path relinking for capacitated clustering
- 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
- 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 hybrid MIP-based large neighborhood search heuristic for solving the machine reassignment problem
- A tabu search heuristic for the generalized minimum spanning tree problem
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- The generalized minimum edge-biconnected network problem: efficient neighborhood structures for variable neighborhood search
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
Uses Software
This page was built for publication: Combining variable neighborhood search with integer linear programming 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 Q953318)
