Minimum cost strong network orientation problems: Classification, algorithms and complexity

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)57-70
JournalNetworks
Volume33
Issue number1
DOIs
Publication statusPublished - 1999

Cite this

Minimum cost strong network orientation problems: Classification, algorithms and complexity. / Burkard, Rainer Ernst; Feldbacher, Karin; Klinz, Bettina; Wöginger, Gerhard Johannes.

In: Networks, Vol. 33, No. 1, 1999, p. 57-70.

Research output: Contribution to journalArticleResearchpeer-review

@article{ef1f669e2f6140898f88f9d00f0697a9,
title = "Minimum cost strong network orientation problems: Classification, algorithms and complexity",
author = "Burkard, {Rainer Ernst} and Karin Feldbacher and Bettina Klinz and W{\"o}ginger, {Gerhard Johannes}",
year = "1999",
doi = "10.1002/(SICI)1097-0037(199901)33:1<57::AID-NET4>3.0.CO;2-R",
language = "English",
volume = "33",
pages = "57--70",
journal = "Networks",
issn = "0028-3045",
publisher = "Wiley-Liss Inc.",
number = "1",

}

TY - JOUR

T1 - Minimum cost strong network orientation problems: Classification, algorithms and complexity

AU - Burkard, Rainer Ernst

AU - Feldbacher, Karin

AU - Klinz, Bettina

AU - Wöginger, Gerhard Johannes

PY - 1999

Y1 - 1999

U2 - 10.1002/(SICI)1097-0037(199901)33:1<57::AID-NET4>3.0.CO;2-R

DO - 10.1002/(SICI)1097-0037(199901)33:1<57::AID-NET4>3.0.CO;2-R

M3 - Article

VL - 33

SP - 57

EP - 70

JO - Networks

JF - Networks

SN - 0028-3045

IS - 1

ER -