The SCEAS System
Navigation Menu

Journals in DBLP

Oper. Res. Lett.
1999, volume: 24, number: 1-2

  1. Ward Whitt
    Using different response-time requirements to smooth time-varying demand for service. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:1-10 [Journal]
  2. Bruce A. Reed
    Edge coloring nearly bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:11-14 [Journal]
  3. O. L. Mangasarian
    Arbitrary-norm separating plane. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:15-23 [Journal]
  4. Dorit S. Hochbaum, Gerhard J. Woeginger
    A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:25-28 [Journal]
  5. Shoshana Anily, Julien Bramel, Alain Hertz
    A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:29-35 [Journal]
  6. Claus C. Carøe, Rüdiger Schultz
    Dual decomposition in stochastic integer programming. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:37-45 [Journal]
  7. Wai-Kei Mak, David P. Morton, R. Kevin Wood
    Monte Carlo bounding techniques for determining solution quality in stochastic programs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:47-56 [Journal]
  8. P. Das, N. R. Chakraborty, P. K. Chaudhuri
    A polynomial time algorithm for a hemispherical minimax location problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:57-63 [Journal]
  9. Jinn-Tsair Teng, Maw-Sheng Chern, Hui-Ling Yang, Yuchung J. Wang
    Deterministic lot-size inventory models with shortages and deterioration for fluctuating demand. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:65-72 [Journal]
  10. Patrick Healy, Marcus Creavin, Ago Kuusik
    An optimal algorithm for rectangle placement. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:73-80 [Journal]
  11. Nicole Bäuerle
    How to improve the performance of ATM multiplexers. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:81-89 [Journal]
  12. Aziz Moukrim
    Optimal scheduling on parallel machines for a new order class. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 1999, v:24, n:1-2, pp:91-95 [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