| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A polynomial algorithm for a one machine batching problem
|
Shallcross, David F
|
|
1992
|
11 |
4 |
p. 213-218
6 p.
|
article
|
| 2 |
Bounding the variance in Monte Carlo experiments
|
Fishman, George S
|
|
1992
|
11 |
4 |
p. 243-248
6 p.
|
article
|
| 3 |
Large-step markov chains for the TSP incorporating local search heuristics
|
Martin, Olivier
|
|
1992
|
11 |
4 |
p. 219-224
6 p.
|
article
|
| 4 |
On interior algorithms for linear programming with no regularity assumptions
|
Anstreicher, Kurt M
|
|
1992
|
11 |
4 |
p. 209-212
4 p.
|
article
|
| 5 |
On the convexity of a function related to the Wagner-Whitin model
|
Tunçel, Levent
|
|
1992
|
11 |
4 |
p. 255-259
5 p.
|
article
|
| 6 |
On the improvement from scheduling a two-station queueing network in heavy traffic
|
Ou, Jihong
|
|
1992
|
11 |
4 |
p. 225-232
8 p.
|
article
|
| 7 |
Prior reduced fill-in in solving equations in interior point algorithms
|
Birge, John R
|
|
1992
|
11 |
4 |
p. 195-198
4 p.
|
article
|
| 8 |
The reversibility of cyclic queues
|
Liu, Xiao-Gao
|
|
1992
|
11 |
4 |
p. 233-241
9 p.
|
article
|
| 9 |
Todd's low-complexity algorithm is a predictor-corrector path-following method
|
Todd, M.J
|
|
1992
|
11 |
4 |
p. 199-207
9 p.
|
article
|
| 10 |
Weak duality theorem and complementary slackness theorem for linear matrix programming problems
|
Gyetvàn, Ferenc
|
|
1992
|
11 |
4 |
p. 249-253
5 p.
|
article
|
Journal description