Branch-and-bound algorithms for the test cover problem

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic

Original language	English
Title of host publication	Lecture Notes in Computer Science
Editors	R. Mohring, R. Rajeev
Place of Publication	New York
Publisher	Springer
Pages	223-233
DOIs	https://doi.org/10.1007/3-540-45749-6
Publication status	Published - 2002

Access to Document

@inproceedings{b60de553d6604696bf7923b135a3e7ba,

title = "Branch-and-bound algorithms for the test cover problem",

author = "\{de Bontridder\}, K.M.J. and B.J. Lageweg and J.K. Lenstra and J.B. Orlin and L. Stougie",

year = "2002",

doi = "10.1007/3-540-45749-6",

language = "English",

pages = "223--233",

editor = "R. Mohring and R. Rajeev",

booktitle = "Lecture Notes in Computer Science",

publisher = "Springer",

}

TY - GEN

T1 - Branch-and-bound algorithms for the test cover problem

AU - de Bontridder, K.M.J.

AU - Lageweg, B.J.

AU - Lenstra, J.K.

AU - Orlin, J.B.

AU - Stougie, L.

PY - 2002

Y1 - 2002

U2 - 10.1007/3-540-45749-6

DO - 10.1007/3-540-45749-6

M3 - Conference contribution

SP - 223

EP - 233

BT - Lecture Notes in Computer Science

A2 - Mohring, R.

A2 - Rajeev, R.

PB - Springer

CY - New York

ER -