scientific article; zbMATH DE number 1424554

MaRDI QIDQ4945803zbMATH OpenFDO

Authors Stefan Voß

Publication date 1 December 2002

zbMATH Keywords

application of local searchbibliographyconstruction methodsgreedy approachesheuristic searchminimum cost directed subgraphSteiner's problem in directed graphstabu search metastrategyworst case analysis

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1538542
• scientific article; zbMATH DE number 1323037
• Publication:4945802
• A tabu search heuristic for the Steiner Tree Problem
• scientific article; zbMATH DE number 4010182

Cited in

(13)

• Steiner's problem in graphs: Heuristic methods
• Swap-vertex based neighborhood for Steiner tree problems
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
• scientific article; zbMATH DE number 4010182 (Why is no real title available?)
• scientific article; zbMATH DE number 11140 (Why is no real title available?)
• A tabu search heuristic for the Steiner Tree Problem
• scientific article; zbMATH DE number 1538542 (Why is no real title available?)
• scientific article; zbMATH DE number 1852707 (Why is no real title available?)
• Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
• scientific article; zbMATH DE number 1424553 (Why is no real title available?)
• A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
• Discrete particle swarm optimization for the minimum labelling Steiner tree problem

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication:

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