Sciweavers

982 search results - page 3 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
TCAD
2008
195views more  TCAD 2008»
13 years 7 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...
EVOW
2007
Springer
14 years 1 months ago
An Ant Algorithm for the Steiner Tree Problem in Graphs
The Steiner Tree Problem (STP) in graphs is a well-known
Luc Luyet, Sacha Varone, Nicolas Zufferey
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 1 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 1 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky