A tabu search heuristic for the Steiner Tree Problem
From MaRDI portal
Recommendations
Cites work
Cited in
(13)- Solving the 2-rooted mini-max spanning forest problem by branch-and-bound
- Viral systems: A new bio-inspired optimisation approach
- Reactive tabu search with path-relinking for the Steiner problem in graphs
- Solving the quadratic minimum spanning 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?)
- scientific article; zbMATH DE number 1424553 (Why is no real title available?)
- scientific article; zbMATH DE number 1424554 (Why is no real title available?)
- A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Optimizing the Design of a Wind Farm Collection Network
- Designing a road network for hazardous materials shipments
This page was built for publication: A tabu search heuristic for the Steiner Tree Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4267398)