scientific article; zbMATH DE number 1538542
From MaRDI portal
Publication:4519136
Recommendations
Cited in
(15)- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
- A robust and scalable algorithm for the Steiner problem in graphs
- Applying tabu search to determine new Ramsey graphs
- The rainbow Steiner tree problem
- Reactive tabu search with path-relinking for the Steiner problem in graphs
- scientific article; zbMATH DE number 1215044 (Why is no real title available?)
- A tabu search heuristic for the Steiner Tree Problem
- 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
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
- A tabu search approach for solving a difficult forest harvesting machine location problem
- Minimax regret spanning arborescences under uncertain costs
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 Q4519136)