The SCEAS System
Navigation Menu

Journals in DBLP

Oper. Res. Lett.
2000, volume: 26, number: 3

  1. Francisco Barahona
    On the k-cut problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:3, pp:99-105 [Journal]
  2. Gerhard J. Woeginger
    A comment on scheduling on uniform machines under chain-type precedence constraints. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:3, pp:107-109 [Journal]
  3. Emily Larson Luebke, J. Scott Provan
    On the structure and complexity of the 2-connected Steiner network problem in the plane. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:3, pp:111-116 [Journal]
  4. Gerald G. Brown, Robert F. Dell, Michael P. Olson
    Valid integer polytope (VIP) penalties for branch-and-bound enumeration. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:3, pp:117-126 [Journal]
  5. L. Grippo, M. Sciandrone
    On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:3, pp:127-136 [Journal]
  6. David Perry, Morton J. M. Posner
    A correlated M/G/1-type queue with randomized server repair and maintenance modes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:3, pp:137-147 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002