The SCEAS System
Navigation Menu

Journals in DBLP

Oper. Res. Lett.
2000, volume: 27, number: 5

  1. Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger
    On-line scheduling on a single machine: maximizing the number of early jobs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:193-197 [Journal]
  2. S. Thomas McCormick, Akiyoshi Shioura
    Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:199-207 [Journal]
  3. Amir Beck, Marc Teboulle
    A probabilistic result for the max-cut problem on random graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:209-214 [Journal]
  4. Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger
    Semi-online scheduling with decreasing job sizes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:215-221 [Journal]
  5. Andrzej Czygrinow
    Maximum dispersion problem in dense graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:223-227 [Journal]
  6. Ülkü Gürler, Mustafa Ç. Pinar, Mohamed Mehdi Jelassi
    On closed-form solutions of a resource allocation problem in parallel funding of R&D projects. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:229-234 [Journal]
  7. Soohan Ahn, Gyemin Lee, Jongwoo Jeon
    Analysis of the M/D/1-type queue based on an integer-valued first-order autoregressive process. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:27, n:5, pp:235-241 [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