Journals in DBLP

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

1. Alex R. Berg, Tibor Jordán
   Sparse certificates and removable cycles in l-mixed p-connected graphs. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:2, pp:111-114 [Journal]
   
2. Ernst Althaus, Stefan Funke, Sariel Har-Peled, Jochen Könemann, Edgar A. Ramos, Martin Skutella
   Approximating k-hop minimum-spanning trees. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:2, pp:115-120 [Journal]
   
3. Guochuan Zhang
   A 3-approximation algorithm for two-dimensional bin packing. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:2, pp:121-126 [Journal]
   
4. Evgeny V. Shchepin, Nodari Vakhania
   An optimal rounding gives a better approximation for scheduling unrelated machines. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:2, pp:127-133 [Journal]
   
5. Ramesh Bollapragada, Jeffrey D. Camm, Uday S. Rao, Junying Wu
   A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:2, pp:134-142 [Journal]
   
6. Aziz Moukrim, Alain Quilliot
   Optimal preemptive scheduling on a fixed number of identical parallel machines. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:2, pp:143-150 [Journal]
   
7. Roel Leus, Willy Herroelen
   The complexity of machine scheduling for stability with a single disrupted job. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:2, pp:151-156 [Journal]
   
8. Shuguang Li, Guojun Li, Xiaoli Wang, Qiming Liu
   Minimizing makespan on a single batching machine with release times and non-identical job sizes. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:2, pp:157-164 [Journal]
   
9. Paolo Serafini
   Linear programming with variable matrix entries. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:2, pp:165-170 [Journal]
   
10. Horand I. Gassmann, András Prékopa
    On stages and consistency checks in stochastic programming. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:171-175 [Journal]
    
11. Mark Lewis, Bahram Alidaee, Gary A. Kochenberger
    Using xQx to model and solve the uncapacitated task allocation problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:176-182 [Journal]
    
12. Hansjörg Albrecher
    A note on the asymptotic behaviour of bottleneck problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:183-186 [Journal]
    
13. Hong Chen, Yat-Wah Wan
    Capacity competition of make-to-order firms. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:187-194 [Journal]
    
14. Nikhil Bansal
    On the average sojourn time under M/M/1/SRPT. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:195-200 [Journal]
    
15. Yutaka Baba
    Analysis of a GI/M/1 queue with multiple working vacations. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:201-209 [Journal]
    
16. Gerhard J. Woeginger
    Combinatorial approximation algorithms: a comparative review. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:210-215 [Journal]
    
17. A. Volgenant
    In: Bernhard Korte and Jens Vygen, Editors, Combinatorial Optimization Theory and Algorithms, second ed., Algorithms and Combinatorics, vol 21, Springer, Berlin (2002) ISBN 3-540-43154-3 543pp. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:216-217 [Journal]
    
18. Vitaly A. Strusevich
    Hans Kellerer, Ulrich Pferschy and David Pisinger, Knapsack Problems, Springer, Berlin (2004) ISBN 3-540-40286-1 546pp., EUR 99, 95. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:217-219 [Journal]
    
19. Nesim Erkip
    In: Stanley B. Gershwin, Yves Dallery, Chrissoleon T. Papadopoulos and J. MacGregor Smith, Editors, Analysis and Modeling of Manufacturing Systems, International Series in OperationsResearch and Management Science, Kluwer Academic Publishers, Bosto [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:2, pp:219-220 [Journal]