Journals in DBLP

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

1. Mihály Bárász, Johanna Becker, András Frank
   An algorithm for source location in directed graphs. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:3, pp:221-230 [Journal]
   
2. David Pearson
   A polynomial-time algorithm for the change-making problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:3, pp:231-234 [Journal]
   
3. Ryuhei Miyashiro, Tomomi Matsui
   A polynomial-time algorithm to find an equitable home-away assignment. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:3, pp:235-241 [Journal]
   
4. Refael Hassin, Jérôme Monnot
   The maximum saving partition problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:3, pp:242-248 [Journal]
   
5. Satyaveer Singh Chauhan, Anton V. Eremeev, Anna A. Romanova, Vladimir V. Servakh, Gerhard J. Woeginger
   Approximation of the supply scheduling problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:3, pp:249-254 [Journal]
   
6. Jean-Louis Bouquard, Jean-Charles Billaut, Mikhail A. Kubzin, Vitaly A. Strusevich
   Two-machine flow shop scheduling problems with no-wait jobs. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:3, pp:255-262 [Journal]
   
7. Igor Averbakh, Oded Berman, Ilya Chernykh
   The m-machine flowshop problem with unit-time operations and intree precedence constraints. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:3, pp:263-266 [Journal]
   
8. Nikhil Bansal
   Minimizing flow time on a constant number of machines with preemption. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:3, pp:267-273 [Journal]
   
9. Ada Che, Chengbin Chu
   A polynomial algorithm for no-wait cyclic hoist scheduling in an extended electroplating line. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:3, pp:274-284 [Journal]
   
10. Flip Klijn, Marco Slikker
    Distribution center consolidation games. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:285-288 [Journal]
    
11. Xiaolong Zhang
    Delayed demand information and dampened bullwhip effect. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:289-294 [Journal]
    
12. Tsuyoshi Katayama
    Level-crossing approach to a time-limited service system with two types of vacations. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:295-300 [Journal]
    
13. Seyed M. R. Iravani, Bora Kolfal
    When does the cµ rule apply to finite-population queueing systems? [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:301-304 [Journal]
    
14. Alpár Jüttner
    Optimization with additional variables and constraints. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:305-311 [Journal]
    
15. Oleg A. Prokopyev, Hong-Xuan Huang, Panos M. Pardalos
    On complexity of unconstrained hyperbolic 0-1 programming problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:312-318 [Journal]
    
16. Garud Iyengar, Wanmo Kang
    Inverse conic programming with applications. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:3, pp:319-330 [Journal]