Publication:4378527
From MaRDI portal
DOI<39::AID-NET5>3.0.CO;2-L 10.1002/(SICI)1097-0037(199801)31:1<39::AID-NET5>3.0.CO;2-LzbMath0894.90155MaRDI QIDQ4378527
Abilio Lucena, John E. Beasley
Publication date: 5 March 1998
90C35: Programming involving graphs or networks
Related Items
Improved algorithms for the Steiner problem in networks, Non delayed relax-and-cut algorithms, Heuristics for automated knowledge source integration and service composition, Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut