Journals in DBLP

Oper. Res. Lett.
1999, volume: 24, number: 4

1. Levent Tunçel
   On the condition numbers for polyhedra in Karmarkar's form. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1999, v:24, n:4, pp:149-155 [Journal]
   
2. Petra Schuurman, Gerhard J. Woeginger
   Approximation algorithms for the multiprocessor open shop scheduling problem. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1999, v:24, n:4, pp:157-163 [Journal]
   
3. Robert R. Goldberg, Jacob Shapiro
   A tight upper bound for the k-partition problem on ideal sets. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1999, v:24, n:4, pp:165-173 [Journal]
   
4. Philippe Baptiste
   An O(n⁴) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1999, v:24, n:4, pp:175-180 [Journal]
   
5. C. M. Kenyon, S. Savage, B. Ball
   Equivalence of linear deviation about the mean and mean absolute deviation about the mean objective functions. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1999, v:24, n:4, pp:181-185 [Journal]
   
6. Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs
   An improved general procedure for lexicographic bottleneck problems. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1999, v:24, n:4, pp:187-194 [Journal]
   
7. Dukwon Kim, Panos M. Pardalos
   A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 1999, v:24, n:4, pp:195-203 [Journal]