Journals in DBLP

Oper. Res. Lett.
2005, volume: 33, number: 6

1. Werner R. W. Scheinhardt, Nicky D. van Foreest, Michel Mandjes
   Continuous feedback fluid queues. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:6, pp:551-559 [Journal]
   
2. Dimitra Pinotsi, Michael A. Zazanis
   Synchronized queues with deterministic arrivals. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:6, pp:560-566 [Journal]
   
3. Esa Hyytiä, Jorma T. Virtamo
   Random waypoint model in n-dimensional space. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:6, pp:567-571 [Journal]
   
4. Ananth V. Iyer, Vinayak Deshpande, Zhengping Wu
   Contingency management under asymmetric information. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:6, pp:572-580 [Journal]
   
5. Rogemar S. Mamon, Marianito R. Rodrigo
   Explicit solutions to European options in a regime-switching economy. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:6, pp:581-586 [Journal]
   
6. Berit Johannes
   On the complexity of scheduling unit-time jobs with OR-precedence constraints. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:6, pp:587-596 [Journal]
   
7. Christoph Ambühl, Monaldo Mastrolilli
   On-line scheduling to minimize max flow time: an optimal preemptive algorithm. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:6, pp:597-602 [Journal]
   
8. Frits C. R. Spieksma, Gerhard J. Woeginger
   The no-wait flow-shop paradox. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:6, pp:603-608 [Journal]
   
9. Zhenbo Wang, Wenxun Xing, Fengshan Bai
   No-wait flexible flowshop scheduling with no-idle machines. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:6, pp:609-614 [Journal]
   
10. Samir Elhedhli
    Exact solution of a class of nonlinear knapsack problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:6, pp:615-624 [Journal]
    
11. Adam N. Letchford, Nicholas A. Pearson
    A fast algorithm for minimum weight odd circuits and cuts in planar graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:6, pp:625-628 [Journal]
    
12. Michael Laszlo, Sumitra Mukherjee
    Another greedy heuristic for the constrained forest problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:6, pp:629-633 [Journal]
    
13. Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten
    Complexity of the min-max and min-max regret assignment problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:6, pp:634-640 [Journal]
    
14. Justo Puerto, Antonio M. Rodríguez-Chía
    On the exponential cardinality of FDS for the ordered p-median problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:6, pp:641-651 [Journal]
    
15. Ruud H. Koning
    Book review. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:6, pp:652-653 [Journal]
    
16. Bo Chen
    Book review. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:6, pp:653-654 [Journal]