Faster Algorithms for Steiner Tree and Related Problems: From Theory to Practice

Daniel Rehfeldt ()
Additional contact information
Daniel Rehfeldt: Zuse Institute Berlin

Chapter Chapter 3 in Operations Research Proceedings 2022, 2023, pp 19-25 from Springer

Abstract: Abstract The Steiner tree problem in graphs (SPG) is a classic $$\mathcal{N}\mathcal{P}$$ -hard problem. Many applications can be modeled as SPG or closely related problems. This article describes a state-of-the-art solver for finding optimal solutions to classic Steiner tree and 14 related problem classes. It was developed as part of the author’s doctoral dissertation.

Keywords: Combinatorial optimization; Steiner tree problems; Exact methods (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-24907-5_3

Ordering information: This item can be ordered from
http://www.springer.com/9783031249075

DOI: 10.1007/978-3-031-24907-5_3

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().