Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

Research output: Contribution to journalArticleResearchpeer-review

Original languageEnglish
Pages (from-to)187-215
JournalJournal of combinatorial optimization
Volume12
DOIs
Publication statusPublished - 2006

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem. / Dragoti-Cela, Eranda; Klinz, Bettina; Meyer, Christophe.

In: Journal of combinatorial optimization, Vol. 12, 2006, p. 187-215.

Research output: Contribution to journalArticleResearchpeer-review

@article{d55811dbb6704ec095aed96de1d1680c,
title = "Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem",
author = "Eranda Dragoti-Cela and Bettina Klinz and Christophe Meyer",
year = "2006",
doi = "10.1007/s10878-006-9625-0",
language = "English",
volume = "12",
pages = "187--215",
journal = "Journal of combinatorial optimization",
issn = "1382-6905",
publisher = "Springer Netherlands",

}

TY - JOUR

T1 - Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

AU - Dragoti-Cela, Eranda

AU - Klinz, Bettina

AU - Meyer, Christophe

PY - 2006

Y1 - 2006

U2 - 10.1007/s10878-006-9625-0

DO - 10.1007/s10878-006-9625-0

M3 - Article

VL - 12

SP - 187

EP - 215

JO - Journal of combinatorial optimization

JF - Journal of combinatorial optimization

SN - 1382-6905

ER -