Efficiently solvable special cases of hard combinatorial optimization problems

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)55-69
JournalMathematical programming
Volume79
Publication statusPublished - 1997

Cite this

Efficiently solvable special cases of hard combinatorial optimization problems. / Burkard, Rainer Ernst.

In: Mathematical programming, Vol. 79, 1997, p. 55-69.

Research output: Contribution to journalArticleResearchpeer-review

@article{404e62e6f5d54ad091ec1635bda54ea7,
title = "Efficiently solvable special cases of hard combinatorial optimization problems",
author = "Burkard, {Rainer Ernst}",
year = "1997",
language = "English",
volume = "79",
pages = "55--69",
journal = "Mathematical programming",
issn = "0025-5610",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Efficiently solvable special cases of hard combinatorial optimization problems

AU - Burkard, Rainer Ernst

PY - 1997

Y1 - 1997

M3 - Article

VL - 79

SP - 55

EP - 69

JO - Mathematical programming

JF - Mathematical programming

SN - 0025-5610

ER -