Journals in DBLP

Oper. Res. Lett.
1997, volume: 21, number: 1

1. Hanif D. Sherali, Cihan H. Tuncbilek
   New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:1, pp:1-9 [Journal]
   
2. Vitaly A. Strusevich, L. A. Hall
   An open shop scheduling problem with a non-bottleneck machine. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:1, pp:11-18 [Journal]
   
3. Fangruo Chen, Yu-Sheng Zheng
   Sensitivity analysis of an (s, S) inventory model. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:1, pp:19-23 [Journal]
   
4. K. Szkatuza
   The growth of multi-constraint random knapsacks with large right-hand sides of the constraints. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:1, pp:25-30 [Journal]
   
5. Nan Zhu, Kevin A. Broughan
   On dominated terms in the general knapsack problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:1, pp:31-37 [Journal]
   
6. Jinxing Xie
   Polynomial algorithms for single machine scheduling problems with financial constraints. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:1, pp:39-42 [Journal]
   
7. Mohamed Haouari, Rym M'Hallah
   Heuristic algorithms for the two-stage hybrid flowshop problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:1, pp:43-53 [Journal]