default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 18
Volume 18, Number 1, August 1995
- Carlo Mannino, Antonio Sassano
:
Solving hard set covering problems. 1-5 - Ariel Cohen, Walter A. Burkhard:
A proof of the optimality of the MIN paging algorithm using linear programming duality. 7-13 - Michael C. Fu, Jian-Qiang Hu:
On the relationship of capacitated production/inventory models to manufacturing flow control models. 15-24 - Emanuel Melachrinoudis, J. MacGregor Smith:
An O(mn2) algorithm for the Maximin problem in E2. 25-30 - Attahiru Sule Alfa:
A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service. 31-40 - Wei Li, James M. Tien:
On a direct estimator for average production intervals. 41-47 - Erhan Erkut:
On the credibility of the conditional risk model for routing hazardous materials. 49-52
Volume 18, Number 2, September 1995
- Michael D. Grigoriadis, Leonid G. Khachiyan:
A sublinear-time randomized approximation algorithm for matrix games. 53-58 - Gerard Sierksma, Ruud H. Teunter, Gert A. Tijssen:
Faces of diameter two on the Hamiltonian cycle polytype. 59-64 - Adrian E. Conway, Julian Keilson:
Analysis of a two-stage finite buffer flow controlled queueing model by a compensation method. 65-74 - Xiuli Chao:
A queueing network model with catastrophes and product form solution. 75-79 - Wei Li, Jinhua Cao:
Stochastic scheduling on a single machine subject to multiple breakdowns according to different probabilities. 81-91 - Hans L. Bodlaender, Michael R. Fellows:
W[2]-hardness of precedence constrained K-processor scheduling. 93-97 - Hoang Tuy:
Canonical DC programming problem: Outer approximation methods revisited. 99-106
Volume 18, Number 3, October 1995
- Peter W. Glynn, Ward Whitt:
Heavy-traffic extreme-value limits for queues. 107-111 - Joseph Abate, Gagan L. Choudhury, Ward Whitt:
Calculating the M/G/1 busy-period density and LIFO waiting-time distribution by direct numerical transform inversion. 113-119 - Ad Ridder:
Weak stochastic ordering for multidimensional Markov chains. 121-126 - Bo Chen, André van Vliet, Gerhard J. Woeginger:
An optimal algorithm for preemptive on-line scheduling. 127-131 - Heng-Yi Chao, Mary P. Harper, Russell W. Quong:
A tight lower bound for optimal bin packing. 133-138 - Carlos J. Luz:
An upper bound on the independence number of a graph computable in polynomial-time. 139-145 - C. A. Knox Lovell, Jesús T. Pastor:
Units invariant and translation invariant DEA models. 147-151 - Maiko Shigeno, Satoru Iwata:
A dual approximation approach to weighted matroid intersection. 153-156
Volume 18, Number 4, February 1996
- Irvin J. Lustig, Edward Rothberg:
Gigaflops in linear programming. 157-165 - J. M. J. Schutten:
List scheduling revisited. 167-170 - Santosh N. Kabadi, Y. P. Aneia:
ε-Approximation minimization of convex functions in fixed dimension. 171-176 - Agha Iqbal Ali, Shirley Shmerling:
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies. 177-184 - Eric J. Friedman, Adam Scott Landsberg:
Long-run dynamics of queues: Stability and chaos. 185-191 - Sunan Han, Dawei Hong, Joseph Y.-T. Leung:
Probabilistic analysis of a bin covering algorithm. 193-199 - Guoliang Xue, J. Ben Rosen, Panos M. Pardalos:
A polynomial time dual algorithm for the Euclidean multifacility location problem. 201-204 - Martine Labbé, Edward F. Schmeichel, S. Louis Hakimi:
Errata and comments on "Approximation algorithms for the capacitated plant allocation problem": [Oper. Res. Lett 15 (1994) 115-126]. 205
Volume 18, Number 5, March 1996
- Mauro Dell'Amico, Silvano Martello:
Open shop, satellite communication and a theorem by Egerváry (1931). 207-211 - Christopher J. Donohue, John R. Birge:
An upper bound on the expected value of a non-increasing convex function with convex marginal return functions. 213-221 - Wei-Ping Liu, Jeffrey B. Sidney, André van Vliet:
Ordinal algorithms for parallel machine scheduling. 223-232 - Abraham P. Punnen, Yash P. Aneja:
On k-sum optimization. 233-236 - David A. Stanford, Myron Hlynka:
Observing general service queues before joining. 237-245 - M. L. Chaudhry, U. C. Gupta, James G. C. Templeton:
On the relations among the distributions at different epochs for discrete-time GI/Geom/1 queues. 247-255
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 2024-10-31 20:15 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:
