| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems
|
Mhand Hifi
|
|
2001
|
5 |
4 |
p. 465-494
30 p.
|
artikel
|
| 2 |
Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems
|
Hifi, Mhand
|
|
2001
|
5 |
4 |
p. 465-494
|
artikel
|
| 3 |
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
|
Liang Zhao
|
|
2001
|
5 |
4 |
p. 397-410
14 p.
|
artikel
|
| 4 |
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts
|
Zhao, Liang
|
|
2001
|
5 |
4 |
p. 397-410
|
artikel
|
| 5 |
Mobile Networks and Computing,
|
Mauricio G. C. Resende
|
|
2001
|
5 |
4 |
p. 297-298
2 p.
|
artikel
|
| 6 |
“Mobile Networks and Computing,”
|
Resende, Mauricio G. C.
|
|
2001
|
5 |
4 |
p. 497-498
|
artikel
|
| 7 |
Multichannel Optical Networks Theory and Practice
|
Mauricio G. C. Resende
|
|
2001
|
5 |
4 |
p. 495-496
2 p.
|
artikel
|
| 8 |
Multichannel Optical Networks: Theory and Practice
|
Resende, Mauricio G. C.
|
|
2001
|
5 |
4 |
p. 495-496
|
artikel
|
| 9 |
Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows
|
J. Macgregor Smith
|
|
2001
|
5 |
4 |
p. 421-443
23 p.
|
artikel
|
| 10 |
Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows
|
Smith, J. Macgregor
|
|
2001
|
5 |
4 |
p. 421-443
|
artikel
|
| 11 |
Robot Map Verification of a Graph World
|
Xiaotie Deng
|
|
2001
|
5 |
4 |
p. 383-395
13 p.
|
artikel
|
| 12 |
Robot Map Verification of a Graph World
|
Deng, Xiaotie
|
|
2001
|
5 |
4 |
p. 383-395
|
artikel
|
| 13 |
The Greedier the Better An Efficient Algorithm for Approximating Maximum Independent Set
|
H.Y. Lau
|
|
2001
|
5 |
4 |
p. 411-420
10 p.
|
artikel
|
| 14 |
The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set
|
Lau, H.Y.
|
|
2001
|
5 |
4 |
p. 411-420
|
artikel
|
| 15 |
Tight Performance Bounds of CP-Scheduling on Out-Trees
|
Nodari Vakhania
|
|
2001
|
5 |
4 |
p. 445-464
20 p.
|
artikel
|
| 16 |
Tight Performance Bounds of CP-Scheduling on Out-Trees
|
Vakhania, Nodari
|
|
2001
|
5 |
4 |
p. 445-464
|
artikel
|
Tijdschrift beschrijving