nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue
|
Mizuno, Norihiro |
|
1986 |
5 |
4 |
p. 197-200 4 p. |
artikel |
2 |
A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
|
Anstreicher, Kurt M. |
|
1986 |
5 |
4 |
p. 211-214 4 p. |
artikel |
3 |
C-programming and the minimization of pseudolinear and additive concave functions
|
Sniedovich, Moshe |
|
1986 |
5 |
4 |
p. 185-189 5 p. |
artikel |
4 |
Discrete-time conversion for simulating semi-Markov processes
|
Fox, Bennett L. |
|
1986 |
5 |
4 |
p. 191-196 6 p. |
artikel |
5 |
Improving the Hungarian assignment algorithm
|
Jonker, Roy |
|
1986 |
5 |
4 |
p. 171-175 5 p. |
artikel |
6 |
On the equivalence of the maximum balanced flow problem and the weighted minimax flow problem
|
Fujishige, Satoru |
|
1986 |
5 |
4 |
p. 207-209 3 p. |
artikel |
7 |
On the existence of weak greedy matching heuristics
|
Grigoriadis, M.D |
|
1986 |
5 |
4 |
p. 201-205 5 p. |
artikel |
8 |
Parallel nested dissection for path algebra computations
|
Pan, Victor |
|
1986 |
5 |
4 |
p. 177-184 8 p. |
artikel |
9 |
Stable matching with preferences derived from a psychological model
|
Bartholdi III, John |
|
1986 |
5 |
4 |
p. 165-169 5 p. |
artikel |
10 |
Transforming asymmetric into symmetric traveling salesman problems: erratum
|
Jonker, Roy |
|
1986 |
5 |
4 |
p. 215-216 2 p. |
artikel |