The SCEAS System
Navigation Menu

Journals in DBLP

Oper. Res. Lett.
2001, volume: 29, number: 1

  1. András Prékopa
    On the concavity of multivariate probability distribution functions. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:1, pp:1-4 [Journal]
  2. George J. Kyparisis, Christos Koulamas
    A note on weighted completion time minimization in a flexible flow shop. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:1, pp:5-11 [Journal]
  3. Moshe Zukerman, Long Jia, Timothy D. Neame, Gerhard J. Woeginger
    A polynomially solvable special case of the unbounded knapsack problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:1, pp:13-16 [Journal]
  4. Gaurav Singh
    Performance of critical path type algorithms for scheduling on parallel processors. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:1, pp:17-30 [Journal]
  5. Hande Yaman, Oya Ekin Karasan, Mustafa Ç. Pinar
    The robust spanning tree problem with interval data. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:1, pp:31-40 [Journal]
  6. Feng Zhang, Guochun Tang, Zhi-Long Chen
    A 3/2-approximation algorithm for parallel machine scheduling with controllable processing times. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:1, pp:41-47 [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