Forskning ved Københavns Universitet - Københavns Universitet

Forside

Do inherently sequential branch-and-bound algorithms exist?

Publikation: Bidrag til tidsskriftTidsskriftartikelForskning

Standard

Do inherently sequential branch-and-bound algorithms exist? / Clausen, Jens; Träeff, Jesper L.

I: Parallel Processing Letters, Nr. 4 (1 & 2), 1994, s. 3-13.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskning

Harvard

Clausen, J & Träeff, JL 1994, 'Do inherently sequential branch-and-bound algorithms exist?', Parallel Processing Letters, nr. 4 (1 & 2), s. 3-13.

APA

Clausen, J., & Träeff, J. L. (1994). Do inherently sequential branch-and-bound algorithms exist? Parallel Processing Letters, (4 (1 & 2)), 3-13.

Vancouver

Clausen J, Träeff JL. Do inherently sequential branch-and-bound algorithms exist? Parallel Processing Letters. 1994;(4 (1 & 2)):3-13.

Author

Clausen, Jens ; Träeff, Jesper L. / Do inherently sequential branch-and-bound algorithms exist?. I: Parallel Processing Letters. 1994 ; Nr. 4 (1 & 2). s. 3-13.

Bibtex

@article{6d68c7b074ce11dbbee902004c4f4f50,
title = "Do inherently sequential branch-and-bound algorithms exist?",
author = "Jens Clausen and Tr{\"a}eff, {Jesper L.}",
year = "1994",
language = "English",
pages = "3--13",
journal = "Parallel Processing Letters",
issn = "0129-6264",
publisher = "World Scientific Publishing Co. Pte. Ltd.",
number = "4 (1 & 2)",

}

RIS

TY - JOUR

T1 - Do inherently sequential branch-and-bound algorithms exist?

AU - Clausen, Jens

AU - Träeff, Jesper L.

PY - 1994

Y1 - 1994

M3 - Journal article

SP - 3

EP - 13

JO - Parallel Processing Letters

JF - Parallel Processing Letters

SN - 0129-6264

IS - 4 (1 & 2)

ER -

ID: 262623