| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
|
Blokh, David
|
|
2002
|
119 |
1-2 |
p. 139-148
10 p.
|
artikel
|
| 2 |
Approximation algorithms for multi-parameter graph optimization problems
|
Basov, Ivan
|
|
2002
|
119 |
1-2 |
p. 129-138
10 p.
|
artikel
|
| 3 |
A tabu search algorithm for scheduling a single robot in a job-shop environment
|
Hurink, Johann
|
|
2002
|
119 |
1-2 |
p. 181-203
23 p.
|
artikel
|
| 4 |
Domination analysis of some heuristics for the traveling salesman problem
|
Punnen, Abraham
|
|
2002
|
119 |
1-2 |
p. 117-128
12 p.
|
artikel
|
| 5 |
Generation of lower bounds for minimum span frequency assignment
|
Allen, S.M.
|
|
2002
|
119 |
1-2 |
p. 59-78
20 p.
|
artikel
|
| 6 |
New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
|
Kabadi, Santosh N.
|
|
2002
|
119 |
1-2 |
p. 149-167
19 p.
|
artikel
|
| 7 |
[No title]
|
Gutin, Gregory
|
|
2002
|
119 |
1-2 |
p. 1-2
2 p.
|
artikel
|
| 8 |
On-line scheduling with precedence constraints
|
Azar, Yossi
|
|
2002
|
119 |
1-2 |
p. 169-180
12 p.
|
artikel
|
| 9 |
On the convergence of generalized hill climbing algorithms
|
Johnson, A.W.
|
|
2002
|
119 |
1-2 |
p. 37-57
21 p.
|
artikel
|
| 10 |
Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
|
Gutin, Gregory
|
|
2002
|
119 |
1-2 |
p. 107-116
10 p.
|
artikel
|
| 11 |
Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
|
Anjos, Miguel F.
|
|
2002
|
119 |
1-2 |
p. 79-106
28 p.
|
artikel
|
| 12 |
Tabu search and finite convergence
|
Glover, Fred
|
|
2002
|
119 |
1-2 |
p. 3-36
34 p.
|
artikel
|
Tijdschrift beschrijving