402 search results - page 1 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
NETWORKS
1998
13 years 5 months ago
1998
FOCS
2009
IEEE
14 years 7 days ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
IPCO
2008
13 years 7 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
The Steiner Tree Problem (STP) in graphs is a well-known
ATMOS
2010
13 years 4 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...