nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
|
Malik, Kavindra |
|
1990 |
9 |
1 |
p. 1-7 7 p. |
artikel |
2 |
An adaptive parallel algorithm for analyzing activity networks
|
Chaudhuri, Pranay |
|
1990 |
9 |
1 |
p. 31-34 4 p. |
artikel |
3 |
An exact algorithm for large unbounded knapsack problems
|
Martello, Silvano |
|
1990 |
9 |
1 |
p. 15-20 6 p. |
artikel |
4 |
An infinitesimal perturbation analysis algorithm for a multiclass G/G/1 queue
|
Ho, Yu-Chi |
|
1990 |
9 |
1 |
p. 35-44 10 p. |
artikel |
5 |
A note on the simple queue with variable intensities and two servers
|
Stadje, Wolfgang |
|
1990 |
9 |
1 |
p. 45-49 5 p. |
artikel |
6 |
A robust nonparametric procedure to estimate response functions for binary choice models
|
Stam, Antonie |
|
1990 |
9 |
1 |
p. 51-58 8 p. |
artikel |
7 |
Call for papers
|
|
|
1990 |
9 |
1 |
p. 71- 1 p. |
artikel |
8 |
Coefficient reduction for knapsack-like constraints in 0–1 programs with variable upper bounds
|
Dietrich, B.L. |
|
1990 |
9 |
1 |
p. 9-14 6 p. |
artikel |
9 |
Editorial Board
|
|
|
1990 |
9 |
1 |
p. ii- 1 p. |
artikel |
10 |
Facet defining inequalities for the dichotomous knapsack problem
|
Gottlieb, Elsie Sterbin |
|
1990 |
9 |
1 |
p. 21-29 9 p. |
artikel |
11 |
Interdeparture times in M/G/1 queueing systems with non-preemptive priority discipline
|
Delbrouck, L.E.N. |
|
1990 |
9 |
1 |
p. 65-69 5 p. |
artikel |
12 |
On the largest negative eigenvalue of the infinitesimal generator associated with M/M/n/n queues
|
Kajima, Masaaki |
|
1990 |
9 |
1 |
p. 59-64 6 p. |
artikel |