| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Backbone guided tabu search for solving the UBQP problem
|
Wang, Yang
|
|
2011
|
19 |
4 |
p. 679-695
|
artikel
|
| 2 |
D-optimal matrices via quadratic integer optimization
|
Kotsireas, I. S.
|
|
2011
|
19 |
4 |
p. 617-627
|
artikel
|
| 3 |
Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization
|
Chicano, Francisco
|
|
2011
|
19 |
4 |
p. 711-728
|
artikel
|
| 4 |
Heuristics and metaheuristics for the maximum diversity problem
|
Martí, Rafael
|
|
2011
|
19 |
4 |
p. 591-615
|
artikel
|
| 5 |
Introduction to special xQx issue
|
Kochenberger, Gary
|
|
2013
|
19 |
4 |
p. 525-528
|
artikel
|
| 6 |
Metaheuristics for robust graph coloring
|
Wang, Fan
|
|
2011
|
19 |
4 |
p. 529-548
|
artikel
|
| 7 |
On characterization of maximal independent sets via quadratic optimization
|
Mahdavi Pajouh, Foad
|
|
2011
|
19 |
4 |
p. 629-644
|
artikel
|
| 8 |
Quadratic bottleneck knapsack problems
|
Zhang, Ruonan
|
|
2011
|
19 |
4 |
p. 573-589
|
artikel
|
| 9 |
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems
|
Hanafi, Saïd
|
|
2011
|
19 |
4 |
p. 645-677
|
artikel
|
| 10 |
Solving large scale Max Cut problems via tabu search
|
Kochenberger, Gary A.
|
|
2011
|
19 |
4 |
p. 565-571
|
artikel
|
| 11 |
Test-assignment: a quadratic coloring problem
|
Duives, Jelle
|
|
2011
|
19 |
4 |
p. 549-564
|
artikel
|
| 12 |
Variable objective search
|
Butenko, Sergiy
|
|
2011
|
19 |
4 |
p. 697-709
|
artikel
|
Tijdschrift beschrijving