no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A linear time bin-packing algorithm
|
Martel, Charles U |
|
1985 |
4 |
4 |
p. 189-192 4 p. |
article |
2 |
A setup heuristic for interval orders
|
Faigle, Ulrich |
|
1985 |
4 |
4 |
p. 185-188 4 p. |
article |
3 |
A single server queue in a hard-real-time environment
|
Baccelli, Francois |
|
1985 |
4 |
4 |
p. 161-168 8 p. |
article |
4 |
Maximal mean/standard deviation ratio in an undiscounted MDP
|
Sobel, Matthew J |
|
1985 |
4 |
4 |
p. 157-159 3 p. |
article |
5 |
New labeling procedures for the basis graph in generalized networks
|
Engquist, Michael |
|
1985 |
4 |
4 |
p. 151-155 5 p. |
article |
6 |
On lower bounds for a class of quadratic 0, 1 programs
|
Assad, Arjang A |
|
1985 |
4 |
4 |
p. 175-180 6 p. |
article |
7 |
Production and location on a network under demand uncertainty
|
Louveaux, François |
|
1985 |
4 |
4 |
p. 145-149 5 p. |
article |
8 |
Random near-regular graphs and the node packing problem
|
Grimmett, G.R |
|
1985 |
4 |
4 |
p. 169-174 6 p. |
article |
9 |
Spying on the cost structure of naive bidding competitors via linear programming models
|
Troutt, Marvin D |
|
1985 |
4 |
4 |
p. 181-184 4 p. |
article |
10 |
Upper bounds for the risk in the α — t utility function
|
Grove, M.A |
|
1985 |
4 |
4 |
p. 193-195 3 p. |
article |