Journals in DBLP

Oper. Res. Lett.
2003, volume: 31, number: 2

1. Shane G. Henderson, Peter W. Glynn
   Nonexistence of a class of variate generation schemes. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:2, pp:83-89 [Journal]
   
2. Alfred Müller
   On the interplay between variability and negative dependence for bivariate distributions. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:2, pp:90-94 [Journal]
   
3. Krishnan Kumaran, Michel Mandjes, Alexander L. Stolyar
   Convexity properties of loss and overflow functions. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:2, pp:95-100 [Journal]
   
4. Mohan L. Chaudhry, Nam K. Kim
   A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:2, pp:101-107 [Journal]
   
5. Alexander N. Dudin, Valentina I. Klimenok
   Optimal admission control in a queueing system with heterogeneous traffic. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:2, pp:108-118 [Journal]
   
6. Jiahua Chen, Dennis K. J. Lin, Douglas J. Thomas
   On the single item fill rate for a finite horizon. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:2, pp:119-123 [Journal]
   
7. Jesús M. Jorge
   Maximal descriptor set characterizations of efficient faces in multiple objective linear programming. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:2, pp:124-128 [Journal]
   
8. Peter Brucker, Silvia Heitmann, Johann Hurink
   How useful are preemptive schedules? [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:2, pp:129-136 [Journal]
   
9. Cor A. J. Hurkens, Tjark Vredeveld
   Local search for multiprocessor scheduling: how many moves does it take to a local optimum? [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2003, v:31, n:2, pp:137-141 [Journal]
   
10. Federico Della Croce, Vincent T'Kindt
    Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:2, pp:142-148 [Journal]
    
11. Stefano Pallottino, Maria Grazia Scutellà
    A new algorithm for reoptimizing shortest paths when the arc costs change. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:2, pp:149-160 [Journal]
    
12. Liping Zhang
    On the convergence of a modified algorithm for the spherical facility location problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:2, pp:161-166 [Journal]