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

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	187-215
Journal	Journal of Combinatorial Optimization
Volume	12
DOIs	https://doi.org/10.1007/s10878-006-9625-0
Publication status	Published - 2006

Fields of Expertise

@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 = "1573-2886",

publisher = "Springer Science+Business Media B.V ",

}

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

SN - 1573-2886

VL - 12

SP - 187

EP - 215

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

ER -