| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A comment on a minmax location problem
|
Woeginger, Gerhard J.
|
|
1998
|
23 |
1-2 |
p. 41-43
3 p.
|
article
|
| 2 |
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
|
Schuurman, Petra
|
|
1998
|
23 |
1-2 |
p. 9-11
3 p.
|
article
|
| 3 |
A long-step primal–dual path-following method for semidefinite programming
|
Jiang, Jianmin
|
|
1998
|
23 |
1-2 |
p. 53-61
9 p.
|
article
|
| 4 |
A three-class variance swapping technique for simulation experiments
|
Song, Wheyming Tina
|
|
1998
|
23 |
1-2 |
p. 63-70
8 p.
|
article
|
| 5 |
Calculation of stability radii for combinatorial optimization problems
|
Chakravarti, Nilotpal
|
|
1998
|
23 |
1-2 |
p. 1-7
7 p.
|
article
|
| 6 |
Lexicographic bottleneck combinatorial problems
|
Sokkalingam, P.T.
|
|
1998
|
23 |
1-2 |
p. 27-33
7 p.
|
article
|
| 7 |
Separating subdivision of bicycle wheel inequalities over cut polytopes
|
Cheng, Eddie
|
|
1998
|
23 |
1-2 |
p. 13-19
7 p.
|
article
|
| 8 |
Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
|
Kanzow, Christian
|
|
1998
|
23 |
1-2 |
p. 45-51
7 p.
|
article
|
| 9 |
The complexity of cover inequality separation 1 1 This research was supported by US Army Research Office DAAH04-94-G-0017 and NSF Grant No. DMI-9700285.
|
Klabjan, D
|
|
1998
|
23 |
1-2 |
p. 35-40
6 p.
|
article
|
| 10 |
The 2-hop spanning tree problem
|
Dahl, Geir
|
|
1998
|
23 |
1-2 |
p. 21-26
6 p.
|
article
|
Journal description