Journals in DBLP

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

1. Madhur Malik, S. R. Mohan
   Cone complementarity problems with finite solution sets. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:2, pp:121-126 [Journal]
   
2. Y. Y. Zhou, Xiaoqi Yang
   Augmented Lagrangian function, non-quadratic growth condition and exact penalization. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:2, pp:127-134 [Journal]
   
3. Jinyan Fan, Puyan Nie
   Quadratic programs over the Stiefel manifold. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:2, pp:135-141 [Journal]
   
4. Nicolae Popovici
   Structure of efficient sets in lexicographic quasiconvex multicriteria optimization. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:2, pp:142-148 [Journal]
   
5. M. V. Devyaterikova, A. A. Kolokolov
   On the stability of some integer programming algorithms. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:2, pp:149-154 [Journal]
   
6. Lars Relund Nielsen, Daniele Pretolani, Kim Allan Andersen
   Finding the K shortest hyperpaths using reoptimization. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:2, pp:155-164 [Journal]
   
7. Igor Averbakh, Vasilij Lebedev
   The competitive salesman problem on a network: a worst-case approach. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:2, pp:165-174 [Journal]
   
8. Vladimir G. Deineko, Gerhard J. Woeginger
   On the robust assignment problem under a fixed number of cost scenarios. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:2, pp:175-179 [Journal]
   
9. Vivek F. Farias, Benjamin Van Roy
   Approximation algorithms for dynamic resource allocation. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2006, v:34, n:2, pp:180-190 [Journal]
   
10. Refael Hassin, Moshe Haviv
    Who should be given priority in a queue? [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:2, pp:191-198 [Journal]
    
11. Jiankui Yang, J. G. Dai, Jian-Gong You, Hanqin Zhang
    A simple proof of diffusion approximations for LBFS re-entrant lines. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:2, pp:199-204 [Journal]
    
12. Thomas Hanschke
    Approximations for the mean queue length of the GI^X/G^{(b, b)}/c queue. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:2, pp:205-213 [Journal]
    
13. Serhan Ziya, Hayriye Ayhan, Robert D. Foley
    Optimal prices for finite capacity queueing systems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:2, pp:214-218 [Journal]
    
14. Nelly Litvak
    Optimal picking of large orders in carousel systems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:2, pp:219-227 [Journal]
    
15. Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, David Simchi-Levi, Chung-Piaw Teo
    Inventory placement in acyclic supply chain networks. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:2, pp:228-238 [Journal]
    
16. Jean Derks
    Book review. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:2, pp:239-240 [Journal]