Swap-vertex based neighborhood for Steiner tree problems

DOI10.1007/s12532-016-0116-8zbMath1387.90214OpenAlexW2564086439MaRDI QIDQ1699620

Jin-Kao Hao, Zhang-Hua Fu

Publication date: 23 February 2018

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-016-0116-8

zbMATH Keywords

network designSteiner tree problems11th DIMACS implementation challengeauxiliary evaluation functionswap-vertex move

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Stronger path‐based extended formulation for the Steiner tree problem ⋮ A linear programming based approach to the Steiner tree problem with a fixed number of terminals ⋮ Heuristic and exact algorithms for minimum-weight non-spanning arborescences ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

Uses Software

• DIMACS
• FindSteinerTree
• SCIP-Jack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to find Steiner minimal trees in Euclidean \(d\)-space
• The Steiner tree problem with hop constraints
• A robust and scalable algorithm for the Steiner problem in graphs
• Thinning out Steiner trees: a node-based model for uniform edge costs
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• A note on the generalized Steiner tree polytope
• Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
• An improved simulated annealing algorithm for bandwidth minimization
• An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
• The node-weighted steiner tree problem
• Dynamic Steiner Tree Problem
• On Steiner Minimal Trees with Rectilinear Distance
• Approximation Algorithms for Directed Steiner Problems
• The Maximum Weight Connected Subgraph Problem
• Fast local search for the steiner problem in graphs
• The Rectilinear Steiner Arborescence Problem Is NP-Complete
• Steiner's problem in graphs and its implications
• Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity

This page was built for publication: Swap-vertex based neighborhood for Steiner tree problems