Patterning of highly conducting polyaniline films
T. Graham, A. Afzali, et al.
Microlithography 2000
This paper presents an algorithm to obtain near optimal solutions for the Steiner tree problem in graphs. It is based on a Lagrangian relaxation of a multi-commodity flow formulation of the problem. An extension of the subgradient algorithm, the volume algorithm, has been used to obtain lower bounds and to estimate primal solutions. It was possible to solve several difficult instances from the literature to proven optimality without branching. Computational results are reported for problems drawn from the SteinLib library.
T. Graham, A. Afzali, et al.
Microlithography 2000
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics