Journals in DBLP
Han Hoogeveen , Chris N. Potts , Gerhard J. Woeginger On-line scheduling on a single machine: maximizing the number of early jobs. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2000, v:27, n:5, pp:193-197 [Journal ] S. Thomas McCormick , Akiyoshi Shioura Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2000, v:27, n:5, pp:199-207 [Journal ] Amir Beck , Marc Teboulle A probabilistic result for the max-cut problem on random graphs. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2000, v:27, n:5, pp:209-214 [Journal ] Steven S. Seiden , Jiri Sgall , Gerhard J. Woeginger Semi-online scheduling with decreasing job sizes. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2000, v:27, n:5, pp:215-221 [Journal ] Andrzej Czygrinow Maximum dispersion problem in dense graphs. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2000, v:27, n:5, pp:223-227 [Journal ] Ülkü Gürler , Mustafa Ç. Pinar , Mohamed Mehdi Jelassi On closed-form solutions of a resource allocation problem in parallel funding of R&D projects. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2000, v:27, n:5, pp:229-234 [Journal ] Soohan Ahn , Gyemin Lee , Jongwoo Jeon Analysis of the M/D/1-type queue based on an integer-valued first-order autoregressive process. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2000, v:27, n:5, pp:235-241 [Journal ]