Path-distance heuristics for the Steiner problem in undirected networks

Research output: Contribution to journal › Journal article › Research › peer-review

Standard

Path-distance heuristics for the Steiner problem in undirected networks. / Winter, P.; Smith, J.M.

In: Algorithmica, No. 7, 1992, p. 309-327.

Research output: Contribution to journal › Journal article › Research › peer-review

Harvard

Winter, P & Smith, JM 1992, 'Path-distance heuristics for the Steiner problem in undirected networks', Algorithmica, no. 7, pp. 309-327.

APA

Winter, P., & Smith, J. M. (1992). Path-distance heuristics for the Steiner problem in undirected networks. Algorithmica, (7), 309-327.

Vancouver

Winter P, Smith JM. Path-distance heuristics for the Steiner problem in undirected networks. Algorithmica. 1992;(7):309-327.

Author

Winter, P. ; Smith, J.M. / Path-distance heuristics for the Steiner problem in undirected networks. In: Algorithmica. 1992 ; No. 7. pp. 309-327.

Bibtex

@article{c29ec94074cf11dbbee902004c4f4f50,
title = "Path-distance heuristics for the Steiner problem in undirected networks",
author = "P. Winter and J.M. Smith",
year = "1992",
language = "English",
pages = "309--327",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer",
number = "7",

}

RIS

TY - JOUR

T1 - Path-distance heuristics for the Steiner problem in undirected networks

AU - Winter, P.

AU - Smith, J.M.

PY - 1992

Y1 - 1992

M3 - Journal article

SP - 309

EP - 327

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 7

ER -

ID: 284354