Journals in DBLP
Cor A. J. Hurkens , Gerhard J. Woeginger On the nearest neighbor rule for the traveling salesman problem. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:1-4 [Journal ] Alberto Caprara , Michele Monaci On the two-dimensional Knapsack Problem. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:5-14 [Journal ] Geir Dahl , Luis Gouveia On the directed hop-constrained shortest path problem. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:15-22 [Journal ] Tamás Fleiner , András Frank , Satoru Iwata A constrained independent set problem for matroids. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:23-26 [Journal ] Abraham P. Punnen , Yash P. Aneja Lexicographic balanced optimization problems. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:27-30 [Journal ] Akiyoshi Shioura The MA-ordering max-flow algorithm is not strongly polynomial for directed networks. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:31-35 [Journal ] Ionut D. Aron , Pascal Van Hentenryck On the complexity of the robust spanning tree problem with interval data. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:36-40 [Journal ] Maxim Sviridenko A note on maximizing a submodular set function subject to a knapsack constraint. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:41-43 [Journal ] Ahmet B. Keha , Ismael R. de Farias Jr. , George L. Nemhauser Models for representing piecewise linear cost functions. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:44-48 [Journal ] Dorit S. Hochbaum Monotonizing linear programs with up to two nonzeroes per column. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:49-58 [Journal ] András Prékopa , Xiaoling Hou A stochastic programming model to find optimal sample sizes to estimate unknown parameters in an LP. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:59-67 [Journal ] A. Grosso , F. Della Croce , R. Tadei An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:68-72 [Journal ] Adam Wierman , Nikhil Bansal , Mor Harchol-Balter A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:73-76 [Journal ] Zhe George Zhang , Naishuo Tian The N threshold policy for the GI /M /1 queue. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:77-84 [Journal ] Bong Dae Choi , Bara Kim , Gang Uk Hwang , Jae-kyoon Kim The analysis of a multiserver queue fed by a discrete autoregressive process of order 1. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:85-93 [Journal ] Jens Leth Hougaard , Hans Keiding Continuous benchmark selections. [Citation Graph (0, 0)][DBLP ] Oper. Res. Lett., 2004, v:32, n:1, pp:94-98 [Journal ]