The SCEAS System
Navigation Menu

Journals in DBLP

Oper. Res. Lett.
2002, volume: 30, number: 3

  1. Ravindra K. Ahuja, James B. Orlin, Prabha Sharma, P. T. Sokkalingam
    A network simplex algorithm with O(n) consecutive degenerate pivots. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:141-148 [Journal]
  2. Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir
    Algorithmic results for ordered median problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:149-158 [Journal]
  3. David J. Rader Jr., Gerhard J. Woeginger
    The quadratic 0-1 knapsack problem with series-parallel support. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:159-166 [Journal]
  4. Gerhard J. Woeginger
    Embeddings of planar graphs that minimize the number of long-face cycles. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:167-168 [Journal]
  5. Brady Hunsaker, Martin W. P. Savelsbergh
    Efficient feasibility testing for dial-a-ride problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:169-173 [Journal]
  6. Mohan L. Chaudhry, Bong K. Yoon, Kyung C. Chae
    Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:174-180 [Journal]
  7. Anand Paul
    On bivariate dependence and the convex order. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:181-188 [Journal]
  8. John D. Lamb, Russell C. H. Cheng
    Optimal allocation of runs in a simulation metamodel with several independent variables. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:189-194 [Journal]
  9. Doo-Hyun Choi
    Cooperative mutation based evolutionary programming for continuous function optimization. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:195-201 [Journal]
  10. Zhenghai Huang
    Sufficient conditions on nonemptiness and boundedness of the solution set of the P0 function nonlinear complementarity problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:3, pp:202-210 [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