The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Ismael R. de Farias Jr., George L. Nemhauser
    A family of inequalities for the generalized assignment polytope. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:2, pp:49-55 [Journal]
  2. Winfried K. Grassmann, Xin Chen, Brij R. K. Kashyap
    Optimal service rates for the state-dependent M/G/1 queues in steady state. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:2, pp:57-63 [Journal]
  3. Joachim Breit, Günter Schmidt, Vitaly A. Strusevich
    Two-machine open shop scheduling with an availability constraint. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:2, pp:65-77 [Journal]
  4. Csanád Imreh
    Online strip packing with modifiable boxes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:2, pp:79-85 [Journal]
  5. X. L. Sun, D. Li
    On the relationship between the integer and continuous solutions of convex programs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:2, pp:87-92 [Journal]
  6. Leah Epstein
    Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2001, v:29, n:2, pp:93-98 [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