| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A linear-time median-finding algorithm for projecting a vector on the simplex of R n
|
Maculan, Nelson
|
|
1989
|
8 |
4 |
p. 219-222
4 p.
|
article
|
| 2 |
A note on maximal mean/standard deviation ratio in an undiscounted MDP
|
Chung, Kun-Jen
|
|
1989
|
8 |
4 |
p. 201-203
3 p.
|
article
|
| 3 |
A note on order preserving matchings
|
Margot, F.
|
|
1989
|
8 |
4 |
p. 197-200
4 p.
|
article
|
| 4 |
Average cost expansion sequencing
|
Erlenkotter, Donald
|
|
1989
|
8 |
4 |
p. 185-187
3 p.
|
article
|
| 5 |
Combinations of forecasts: A model-building perspective
|
Bunn, Derek
|
|
1989
|
8 |
4 |
p. 179-184
6 p.
|
article
|
| 6 |
Efficient algorithm for additive and multiplicative models in data envelopment analysis
|
Sueyoshi, Toshiyuki
|
|
1989
|
8 |
4 |
p. 205-213
9 p.
|
article
|
| 7 |
Lagrangian dual ascent by generalized linear programming
|
Hearn, Donald W.
|
|
1989
|
8 |
4 |
p. 189-196
8 p.
|
article
|
| 8 |
On a cardinality constrained linear programming knapsack problem
|
Dudzinski, Krzyszof
|
|
1989
|
8 |
4 |
p. 215-218
4 p.
|
article
|
| 9 |
Queue length distributions from probability generating functions via discrete fourier transforms
|
Daigle, John N.
|
|
1989
|
8 |
4 |
p. 229-236
8 p.
|
article
|
| 10 |
The k most vital arcs in the shortest path problem
|
Malik, K.
|
|
1989
|
8 |
4 |
p. 223-227
5 p.
|
article
|
Journal description