Journal: Oper. Res. Lett.

Volume 24, Issue 4

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