Journals in DBLP

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

1. Mustafa Ç. Pinar, Reha H. Tütüncü
   Robust profit opportunities in risky financial portfolios. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:331-340 [Journal]
   
2. Liwan H. Liyanage, J. George Shanthikumar
   A practical inventory control policy using operational statistics. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:341-348 [Journal]
   
3. Guillermo Gallego, Özalp Özer
   A new algorithm and a new heuristic for serial supply systems. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:349-362 [Journal]
   
4. Ward Whitt
   Two fluid approximations for multi-server queues with abandonments. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:363-372 [Journal]
   
5. Benny Van Houdt, Attahiru Sule Alfa
   Response time in a tandem queue with blocking, Markovian arrivals and phase-type services. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:373-381 [Journal]
   
6. Dániel Marx
   A short proof of the NP-completeness of minimum sum interval coloring. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:382-384 [Journal]
   
7. David Avis, Caterina De Simone, Bruce A. Reed
   On the fractional chromatic index of a graph and its complement. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:385-388 [Journal]
   
8. Masataka Nakamura
   Characterizations of polygreedoids and poly-antimatroids by greedy algorithms. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:389-394 [Journal]
   
9. Pawel Winter, Martin Zachariasen
   Two-connected Steiner networks: structural properties. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2005, v:33, n:4, pp:395-402 [Journal]
   
10. Andreas Baltz, Anand Srivastav
    Approximation algorithms for the Euclidean bipartite TSP. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:403-410 [Journal]
    
11. Raymond K. Cheung, Darren D. Hang, Ning Shi
    A labeling method for dynamic driver-task assignment with uncertain task durations. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:411-420 [Journal]
    
12. S. M. R. Iravani, C. P. Teo
    Asymptotically optimal schedules for single-server flow shop problems with setup costs and times. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:421-430 [Journal]
    
13. Adam Kasperski
    Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:431-436 [Journal]
    
14. László Lovász
    Review of the book by Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:4, pp:437-440 [Journal]