Paper Info
Title
An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs
Abstract
An exact branch and bound algorithm for the Steiner Problem in Graphs (SPG) is presented, based on a new integer programming formulation. The algorithm proves to be robust and relatively efficient based on preliminary results obtained for average-size problems.
Year
DOI
Venue
1995
10.1007/BFb0030880
COCOON
Keywords
Field
DocType
exact branch,bound algorithm,steiner problem,branch and bound algorithm,relative efficiency
Graph,Discrete mathematics,Combinatorics,Branch and bound,Steiner tree problem,Branch and cut,Branch and price,Integer programming,Lattice graph,Mathematics,Search tree
Conference
Volume
ISSN
ISBN
959
0302-9743
3-540-60216-X
Citations 
PageRank 
References 
5
0.57
6
Authors
2
Name
Order
Citations
PageRank
B. N. Khoury1303.73
Panos M. Pardalos23720397.84