International Transactions in Operational Research· 2026Q1
Efficient heuristics for the Steiner forest problem
- 0citations
- Q1SCImago
- 2026year
Short summary
A new constructive algorithm for the Steiner Forest Problem (SFP) outperformed the state-of-the-art primal-dual algorithm, and two novel heuristics (GRASP-SFP and MDM-GRASP-SFP) tied for best results on literature instances.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Industrial and Manufacturing Engineering
Industrial and Manufacturing EngineeringEngineering