Journals in DBLP

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

1. David R. Wood
   An algorithm for finding a maximum clique in a graph. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:5, pp:211-217 [Journal]
   
2. Zeev Nutov, Michal Penn
   Faster approximation algorithms for weighted triconnectivity augmentation problems. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:5, pp:219-223 [Journal]
   
3. Michel Burlet, Olivier Goldschmidt
   A new and improved algorithm for the 3-cut problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:5, pp:225-227 [Journal]
   
4. Jean-François Hêche, Thomas M. Liebling
   Finding minimum area simple pentagons. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:5, pp:229-233 [Journal]
   
5. Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza
   Semi on-line algorithms for the partition problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:5, pp:235-242 [Journal]
   
6. Christian Ewerhart
   Bayesian optimization and genericity. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:5, pp:243-248 [Journal]
   
7. Makoto Doi, Yow-Mow Chen, Hideo Osawa
   A queueing model in which arrival times are scheduled. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1997, v:21, n:5, pp:249-252 [Journal]