| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A 5 3 -approximation algorithm for the clustered traveling salesman tour and path problems
|
Anily, Shoshana
|
|
1999
|
24 |
1-2 |
p. 29-35
7 p.
|
artikel
|
| 2 |
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
|
Hochbaum, Dorit S.
|
|
1999
|
24 |
1-2 |
p. 25-28
4 p.
|
artikel
|
| 3 |
An optimal algorithm for rectangle placement
|
Healy, Patrick
|
|
1999
|
24 |
1-2 |
p. 73-80
8 p.
|
artikel
|
| 4 |
A polynomial time algorithm for a hemispherical minimax location problem
|
Das, P.
|
|
1999
|
24 |
1-2 |
p. 57-63
7 p.
|
artikel
|
| 5 |
Arbitrary-norm separating planefn1 fn1 This material is based on research supported by NSF Grant CCR-9322479 and AFOSR Grant F49620-97-1-0326.
|
Mangasarian, O.L.
|
|
1999
|
24 |
1-2 |
p. 15-23
9 p.
|
artikel
|
| 6 |
Deterministic lot-size inventory models with shortages and deterioration for fluctuating demand
|
Teng, Jinn-Tsair
|
|
1999
|
24 |
1-2 |
p. 65-72
8 p.
|
artikel
|
| 7 |
Dual decomposition in stochastic integer programming
|
Carøe, Claus C.
|
|
1999
|
24 |
1-2 |
p. 37-45
9 p.
|
artikel
|
| 8 |
Edge coloring nearly bipartite graphs
|
Reed, Bruce
|
|
1999
|
24 |
1-2 |
p. 11-14
4 p.
|
artikel
|
| 9 |
How to improve the performance of ATM multiplexers
|
Bäuerle, Nicole
|
|
1999
|
24 |
1-2 |
p. 81-89
9 p.
|
artikel
|
| 10 |
Monte Carlo bounding techniques for determining solution quality in stochastic programs
|
Mak, Wai-Kei
|
|
1999
|
24 |
1-2 |
p. 47-56
10 p.
|
artikel
|
| 11 |
Optimal scheduling on parallel machines for a new order class
|
Moukrim, Aziz
|
|
1999
|
24 |
1-2 |
p. 91-95
5 p.
|
artikel
|
| 12 |
Using different response-time requirements to smooth time-varying demand for service
|
Whitt, Ward
|
|
1999
|
24 |
1-2 |
p. 1-10
10 p.
|
artikel
|
Tijdschrift beschrijving