Journals in DBLP

Oper. Res. Lett.
1998, volume: 23, number: 1-2

1. Nilotpal Chakravarti, Albert P. M. Wagelmans
   Calculation of stability radii for combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1998, v:23, n:1-2, pp:1-7 [Journal]
   
2. Petra Schuurman
   A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1998, v:23, n:1-2, pp:9-11 [Journal]
   
3. Eddie Cheng
   Separating subdivision of bicycle wheel inequalities over cut polytopes. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1998, v:23, n:1-2, pp:13-19 [Journal]
   
4. Geir Dahl
   The 2-hop spanning tree problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1998, v:23, n:1-2, pp:21-26 [Journal]
   
5. P. T. Sokkalingam, Y. P. Aneja
   Lexicographic bottleneck combinatorial problems. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1998, v:23, n:1-2, pp:27-33 [Journal]
   
6. Diego Klabjan, George L. Nemhauser, C. Tovey
   The complexity of cover inequality separation. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1998, v:23, n:1-2, pp:35-40 [Journal]
   
7. Gerhard J. Woeginger
   A comment on a minmax location problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1998, v:23, n:1-2, pp:41-43 [Journal]
   
8. Christian Kanzow, Masao Fukushima
   Solving box constrained variational inequalities by using the natural residual with D-gap function globalization. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1998, v:23, n:1-2, pp:45-51 [Journal]
   
9. Jianmin Jiang
   A long-step primal-dual path-following method for semidefinite programming. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1998, v:23, n:1-2, pp:53-61 [Journal]
   
10. Wheyming Tina Song, Chien-Chou Su
    A three-class variance swapping technique for simulation experiments. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1998, v:23, n:1-2, pp:63-70 [Journal]