Swap-vertex based neighborhood for Steiner tree problems
type: Item
instance of: scholarly article
title: Swap-vertex based neighborhood for Steiner tree problems
zbMATH Open document ID: 1387.90214
author: Zhanghua Fu
author: Jin-Kao Hao
published in: Mathematical Programming Computation
publication date: 2018-02-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6843009
zbMATH Keywords: network design
zbMATH Keywords: Steiner tree problems
zbMATH Keywords: swap-vertex move
zbMATH Keywords: auxiliary evaluation function
zbMATH Keywords: 11th DIMACS implementation challenge
describes a project that uses: FindSteinerTree
describes a project that uses: SCIP-Jack
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: s12532-016-0116-8
OpenAlex ID: W2564086439
cites work: Q5692514
cites work: Steiner's problem in graphs and its implications
cites work: On Steiner Minimal Trees with Rectilinear Distance
cites work: How to find Steiner minimal trees in Euclidean \(d\)-space
cites work: Q4952698
cites work: The node-weighted steiner tree problem
cites work: The Maximum Weight Connected Subgraph Problem
cites work: Q5708500
cites work: A note on the generalized Steiner tree polytope
cites work: Approximation Algorithms for Directed Steiner Problems
cites work: Dynamic Steiner Tree Problem
cites work: The Steiner tree problem with hop constraints
cites work: Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
cites work: Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints
cites work: Q4198056
cites work: The Rectilinear Steiner Arborescence Problem Is NP-Complete
cites work: Thinning out Steiner trees: a node-based model for uniform edge costs
cites work: SCIP-Jack -- a solver for STP and variants with parallelization extensions
cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs
cites work: Efficient Greedy Heuristics For Steiner Tree Problems Using Reolptimization And Super Modularity
cites work: Fast local search for the steiner problem in graphs
cites work: A robust and scalable algorithm for the Steiner problem in graphs
cites work: Q5379094
cites work: Q5472387
cites work: An improved simulated annealing algorithm for bandwidth minimization
cites work: An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
DOI: 10.1007/S12532-016-0116-8
description: scientific article; zbMATH DE number 6843009