Solving large instances of the quadratic cost parition problem on dense graphs by data-correcting algorithms: a computational study

B. Goldengorin, M. de Vink

Research output: Book/Report › Book › Academic

Original language	Dutch
Place of Publication	Groningen
Publisher	University of Groningen, SOM research school
Volume	126
Edition	A50
Publication status	Published - 1999

Handle.net

@book{7defb97263904731aa431f5c9a5670e1,

title = "Solving large instances of the quadratic cost parition problem on dense graphs by data-correcting algorithms: a computational study",

author = "B. Goldengorin and {de Vink}, M.",

year = "1999",

language = "Dutch",

volume = "126",

publisher = "University of Groningen, SOM research school",

edition = "A50",

}

TY - BOOK

T1 - Solving large instances of the quadratic cost parition problem on dense graphs by data-correcting algorithms: a computational study

AU - Goldengorin, B.

AU - de Vink, M.

PY - 1999

Y1 - 1999

M3 - Book

VL - 126

BT - Solving large instances of the quadratic cost parition problem on dense graphs by data-correcting algorithms: a computational study

PB - University of Groningen, SOM research school

CY - Groningen

ER -