External Links

    Journal: Oper. Res. Lett.

    Volume 19, Issue 5

    201 -- 206Aharon Ben-Tal, Jørgen Tind. Duality with multiple criteria and multiple resources
    207 -- 216Pham Dinh Tao, Le Thi Hoai An. Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
    217 -- 224Joseph L. Ganley, Jeffrey S. Salowe. Optimal and approximate bottleneck Steiner trees
    225 -- 235Suresh P. Sethi, Xun Yu Zhou. Optimal feedback controls in deterministic dynamic two-machine flowshops
    237 -- 242T. C. E. Cheng, Zhi-Long Chen, Chung-Lun Li. Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
    243 -- 250Wlodzimierz Szwarc, Samar K. Mukhopadhyay. Decomposition of the single machine total tardiness problem

    Volume 19, Issue 4

    151 -- 159François Vanderbeck, Laurence A. Wolsey. An exact algorithm for IP column generation
    161 -- 169Ming-Hui Chen, Bruce W. Schmeiser. General Hit-and-Run Monte Carlo sampling for evaluating multidimensional integrals
    171 -- 174Frank K. Hwang, Paul E. Wright. Efficient algorithms for the reliabilities of replicated n-parallel-task graphs
    175 -- 181Jay B. Ghosh. Computational aspects of the maximum diversity problem
    183 -- 190Ivo Adan, Yiqiang Zhao. r/1 queues
    191 -- 199Dragomir D. Dimitrijevic. Inferring most likely queue length from transactional data

    Volume 19, Issue 3

    101 -- 104Wei-Ping Liu, Jeffrey B. Sidney. Bin packing using semi-ordinal data
    105 -- 113Hanif D. Sherali, Gyunghyun Choi. Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
    115 -- 116Caterina De Simone. A note on the Boolean quadric polytope
    117 -- 128Le Thi Hoai An, Pham Dinh Tao, Le Dung Muu. Numerical solution for optimization over the efficient set by d.c. optimization algorithms
    129 -- 134Emilio Carrizosa, Frank Plastria. A characterization of efficient points in constrained location problems with regional demand
    135 -- 141Laurence A. Baxter, Norman A. Marlow. Cumulative operating time distributions for a class of non-Markovian series systems
    143 -- 150Christos Alexopoulos, Andrew F. Seila. A conservative method for selecting the best simulated system

    Volume 19, Issue 2

    51 -- 58Marne C. Cario, Barry L. Nelson. Autoregressive to anything: Time-series input processes for simulation
    59 -- 64Arie Tamir. 2) algorithm for the p-median and related problems on tree graphs
    65 -- 69Yung-Cheng Chang, Lih-Hsing Hsu. On minimal cost-reliability ratio spanning trees and related problems
    71 -- 78Mohamed Didi Biha, Ali Rhida Mahjoub. k-edge connected polyhedra on series-parallel graphs
    79 -- 86Marco Castellani. A necessary second-order optimality condition in nonsmooth mathematical programming
    87 -- 94Serpil Sayin. An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
    95 -- 99S. Thomas McCormick. Submodular containment is hard, even for networks

    Volume 19, Issue 1

    1 -- 9Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj. Gomory cuts revisited
    11 -- 16Linn I. Sennott. The convergence of value iteration in average cost Markov decision chains
    17 -- 23Neng-Hui Shih, Wheyming Tina Song. Correlation-inducing variance reduction in regenerative simulation
    25 -- 28Moshe Haviv. On constrained Markov decision processes
    29 -- 31Sverre Storøy. Optimal weights and degeneracy in variable aggregated linear programs
    33 -- 41Jinn-Tsair Teng. A deterministic inventory replenishment model with a linear trend in demand
    43 -- 49Israel David, Eitan Greenshtein. Brownian analysis of a buffered-flow system in the face of sudden obsolescence
    runs on