default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 14
Volume 14, Number 1, August 1993
- Shaler Stidham Jr., Muhammad El-Taha:
A note on sample-path stability conditions for input - output processes. 1-7 - Viên Nguyen, Martin I. Reiman:
Variance reduction for sensitivity estimates obtained from regenerative simulation. 9-18 - Ravi Mazumdar
, Vivek Badrinath, Fabrice Guillemin, Catherine Rosenberg:
A note on the pathwise version of Little's formula. 19-24 - I-Jen Lee, Emily Roth:
A heuristic for the transient expected queue length of Markovian queueing systems. 25-27 - Myron Hlynka, T. Wang:
Comments on duality of queues with finite buffer size. 29-33 - Masakiyo Miyazawa, Genji Yamazaki:
Note on batch arrival LCFS and related symmetric queues. 35-41 - S. Viswanathan:
Optimal policies for the capacitated two stage multi-item inventory model with joint setup costs. 43-48 - Wieslaw Kubiak:
Completion time variance minimization on a single machine is difficult. 49-59 - Sehun Kim, Bong-sik Um:
An improved subgradient method for constrained nondifferentiable optimization. 61-64
Volume 14, Number 2, September 1993
- Celina Imielinska, Bahman Kalantari, Leonid Khachiyan:
A greedy heuristic for a minimum-weight forest problem. 65-71 - Patrick Jaillet:
Rate of convergence for the Euclidean minimum spanning tree limit law. 73-78 - Arie Tamir:
Complexity results for the p-median problem with mutual communication. 79-84 - S. T. Webster:
Bounds and asymptotic results for the uniform parallel processor weighted flow time problem. 85-90 - Lei Lei, Ronald Armstrong, Shanhong Gu:
Minimizing the fleet size with dependent time-window and single-track constraints. 91-98 - Hoang Tuy, Nguyen Dinh Dan, Saied Ghannadan:
Strongly polynomial time algorithms for certain concave minimization problems on networks. 99-109 - Daoli Zhu, Patrice Marcotte:
Modified descent methods for solving the monotone variational inequality problem. 111-120 - Abraham P. Punnen:
On: Travelling salesman problem under categorization: Operations Research Letters 12 (1992) 89-95. 121
Volume 14, Number 3, October 1993
- Ted K. Ralphs:
On the mixed Chinese postman problem. 123-127 - S. Thomas McCormick:
Approximate binary search algorithms for mean cuts and cycles. 129-132 - Irène Charon, Olivier Hudry:
The noising method: a new method for combinatorial optimization. 133-137 - Bo Chen:
A note on LPT scheduling. 139-142 - Dinah W. Cheng:
Concavity of system throughput and information transfer in a PAC system. 143-146 - Lígia Amado, Paulo Bárcia:
Matroidal relaxations for 0-1 knapsack problems. 147-152 - G. Contaldi, Gianni Di Pillo, Stefano Lucidi:
A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set. 153-161 - Kiran Rege:
On the M/G/1 queue with Bernoulli feedback. 163-170 - Eitan Rosenberg, Uri Yechiali:
The Mx/G/1 queue with single and multiple vacations under the LIFO service regime. 171-179
Volume 14, Number 4, November 1993
- James B. Orlin, Clifford Stein:
Parallel algorithms for the assignment and minimum-cost flow problems. 181-186 - Athanassios N. Avramidis, James R. Wilson:
A splitting scheme for control variates. 187-198 - Hong Chen, Ping Yang, David D. Yao, Xiuli Chao:
Optimal control of a simple assembly system. 199-205 - Andrew J. Lazarus:
Certain expected values in the random assignment problem. 207-214 - Tsung-Chyan Lai:
Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems. 215-220 - Eric J. Friedman, Adam Scott Landsberg:
Short run dynamics of multi-class queues. 221-229 - John Preater:
The senior and junior secretaries problem. 231-235
Volume 14, Number 5, December 1993
- Bahman Kalantari, Leonid Khachiyan:
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. 237-244 - Peter Brucker, Bernd Jurisch, Thomas Tautenhahn, Frank Werner:
Scheduling unit time open shops to minimize the weighted number of late jobs. 245-250 - Irfan M. Ovacik, Reha Uzsoy:
Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times. 251-256 - Abraham Charnes, Moshe Kress:
Two simple applications of the unimodularity property. 257-260 - Wlodzimierz Szwarc:
An instant solution of the 2 × n bottleneck transportation problem. 261-264 - Derek R. Atkins, Shrikanta De:
A performance bound on single cycle lot-sizing policies for an assembly system with stochastic demand. 265-273 - Francis J. Vasko, Micheal L. Cregger, Dennis D. Newhart, Kenneth L. Stott Jr.:
A real-time one-dimensional cutting stock algorithm for balanced cutting patterns. 275-282 - Prafulla Joglekar, Patrick Lee:
An exact formulation of inventory costs and optimal lot size in face of sudden obsolescence. 283-290 - Emilio Carrizosa, Eduardo Conde, Francisco R. Fernández, Justo Puerto:
Efficiency in Euclidean constrained location problems. 291-295
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-05 22:24 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:
