Journals in DBLP

Oper. Res. Lett.
2006, volume: 34, number: 1

1. Alexander Shapiro
   On complexity of multistage stochastic programs. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:1, pp:1-8 [Journal]
   
2. Derek E. Armstrong, Sheldon H. Jacobson
   Order preserving reductions and polynomial improving paths. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:1, pp:9-16 [Journal]
   
3. Olivier Gossner, Penélope Hernández
   Coordination through De Bruijn sequences. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:1, pp:17-21 [Journal]
   
4. Pedro C. Calleja, Arantza Estévez-Fernández, Peter Borm, Herbert Hamers
   Job scheduling, cooperation, and control. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:1, pp:22-28 [Journal]
   
5. Nihat Kasap, Haldun Aytug, Anand Paul
   Minimizing makespan on a single machine subject to random breakdowns. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:1, pp:29-36 [Journal]
   
6. T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger
   Scheduling with step-improving processing times. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:1, pp:37-40 [Journal]
   
7. Özlem Ergun, James B. Orlin
   Fast neighborhood search for the single machine total weighted tardiness problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:1, pp:41-45 [Journal]
   
8. Anand Paul
   On the unimodality of the manufacturer's objective function in the newsvendor model. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:1, pp:46-48 [Journal]
   
9. José E. Valdés, Rómulo I. Zequeira
   On the optimal allocation of two active redundancies in a two-component series system. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:1, pp:49-52 [Journal]
   
10. Donglei Du, Santosh N. Kabadi
    An improved algorithm for decomposing arc flows into multipath flows. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:53-57 [Journal]
    
11. Natashia Boland, John Dethridge, Irina Dumitrescu
    Accelerated label setting algorithms for the elementary resource constrained shortest path problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:58-68 [Journal]
    
12. Adam Kasperski, Pawel Zielinski
    The robust shortest path problem in series-parallel multidigraphs with interval data. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:69-76 [Journal]
    
13. Anna Galluccio, Paolo Nobili
    Improved approximation of maximum vertex cover. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:77-84 [Journal]
    
14. José R. Correa
    Resource augmentation in two-dimensional packing with orthogonal rotations. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:85-93 [Journal]
    
15. Nicolai N. Pisaruk
    A 2-approximation algorithm for the network substitution problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:94-96 [Journal]
    
16. Arie Tamir
    Locating two obnoxious facilities using the weighted maximin criterion. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:97-105 [Journal]
    
17. Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
    The traveling salesman problem with few inner points. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:106-110 [Journal]
    
18. Snezana Mitrovic-Minic, Ramesh Krishnamurti
    The multiple TSP with time windows: vehicle bounds based on precedence graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:111-120 [Journal]