A test problem generator for the Steiner problem in graphs
From MaRDI portal
Publication:4371555
DOI10.1145/168173.168420zbMath0885.90110OpenAlexW2036848747WikidataQ113310501 ScholiaQ113310501MaRDI QIDQ4371555
B. N. Khoury, Ding-Zhu Du, Panos M. Pardalos
Publication date: 26 January 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1993-19/
Related Items
A survey of combinatorial optimization problems in multicast routing ⋮ A heuristic for the Steiner problem in graphs ⋮ Study of multiscale global optimization based on parameter space partition ⋮ An exact branch and bound algorithm for the Steiner Problem in Graphs ⋮ On the chromatic number of graphs ⋮ Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints ⋮ Generating hard and diverse test sets for NP-hard graph problems ⋮ Designing reliable tree networks with two cable technologies