default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 19
Volume 19, Number 1, July 1996
- Egon Balas, Sebastián Ceria, Gérard Cornuéjols, N. Natraj:
Gomory cuts revisited. 1-9 - Linn I. Sennott:
The convergence of value iteration in average cost Markov decision chains. 11-16 - Neng-Hui Shih, Wheyming Tina Song:
Correlation-inducing variance reduction in regenerative simulation. 17-23 - Moshe Haviv:
On constrained Markov decision processes. 25-28 - Sverre Storøy:
Optimal weights and degeneracy in variable aggregated linear programs. 29-31 - Jinn-Tsair Teng:
A deterministic inventory replenishment model with a linear trend in demand. 33-41 - Israel David, Eitan Greenshtein:
Brownian analysis of a buffered-flow system in the face of sudden obsolescence. 43-49
Volume 19, Number 2, August 1996
- Marne C. Cario, Barry L. Nelson:
Autoregressive to anything: Time-series input processes for simulation. 51-58 - Arie Tamir:
An O(pn2) algorithm for the p-median and related problems on tree graphs. 59-64 - Yung-Cheng Chang, Lih-Hsing Hsu:
On minimal cost-reliability ratio spanning trees and related problems. 65-69 - Mohamed Didi Biha, Ali Ridha Mahjoub:
k-edge connected polyhedra on series-parallel graphs. 71-78 - Marco Castellani
:
A necessary second-order optimality condition in nonsmooth mathematical programming. 79-86 - Serpil Sayin:
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming. 87-94 - S. Thomas McCormick:
Submodular containment is hard, even for networks. 95-99
Volume 19, Number 3, September 1996
- Wei-Ping Liu, Jeffrey B. Sidney:
Bin packing using semi-ordinal data. 101-104 - Hanif D. Sherali, Gyunghyun Choi:
Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs. 105-113 - Caterina De Simone:
A note on the Boolean quadric polytope. 115-116 - Le Thi Hoai An, Pham Dinh Tao, Le Dung Muu:
Numerical solution for optimization over the efficient set by d.c. optimization algorithms. 117-128 - Emilio Carrizosa, Frank Plastria:
A characterization of efficient points in constrained location problems with regional demand. 129-134 - Laurence A. Baxter, Norman A. Marlow:
Cumulative operating time distributions for a class of non-Markovian series systems. 135-141 - Christos Alexopoulos, Andrew F. Seila:
A conservative method for selecting the best simulated system. 143-150
Volume 19, Number 4, October 1996
- François Vanderbeck, Laurence A. Wolsey:
An exact algorithm for IP column generation. 151-159 - Ming-Hui Chen, Bruce W. Schmeiser:
General Hit-and-Run Monte Carlo sampling for evaluating multidimensional integrals. 161-169 - Frank K. Hwang, Paul E. Wright:
Efficient algorithms for the reliabilities of replicated n-parallel-task graphs. 171-174 - Jay B. Ghosh:
Computational aspects of the maximum diversity problem. 175-181 - Ivo J. B. F. Adan, Yiqiang Zhao:
Analyzing GI/Er/1 queues. 183-190 - Dragomir D. Dimitrijevic:
Inferring most likely queue length from transactional data. 191-199
Volume 19, Number 5, November 1996
- Aharon Ben-Tal, Jørgen Tind:
Duality with multiple criteria and multiple resources. 201-206 - Pham Dinh Tao, Le Thi Hoai An:
Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres. 207-216 - Joseph L. Ganley, Jeffrey S. Salowe:
Optimal and approximate bottleneck Steiner trees. 217-224 - Suresh P. Sethi, Xun Yu Zhou:
Optimal feedback controls in deterministic dynamic two-machine flowshops. 225-235 - T. C. E. Cheng, Zhi-Long Chen, Chung-Lun Li:
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation. 237-242 - Wlodzimierz Szwarc, Samar K. Mukhopadhyay:
Decomposition of the single machine total tardiness problem. 243-250
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-13 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
