Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 13
Volume 13, Number 1, February 1993
- Chon-Huat Goh, Betsy S. Greenberg, Hirofumi Matsuo:
Perishable inventory systems with batch demand and arrivals. 1-8 - Jiri Rohn:
Stability of the optimal basis of a linear program under uncertainty. 9-12 - Esther Frostig:
On the optimal assignment of servers in a two stations tandem queue with no intermediate waiting room. 13-18 - Jayaram K. Sankaran:
A note on resolving infeasibility in linear programs by constraint relaxation. 19-20 - Zhe George Zhang, Raymond G. Vickson:
A simple approximation for mean waiting time in M/G/1 queue with vacations and limited service discipline. 21-26 - Fong-Yuen Ding, Liping Cheng:
A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems. 27-36 - A. R. Warburton:
Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem. 37-42 - J. F. Weng, Frank K. Hwang:
An optimal group testing algorithm on k disjoint sets. 43-44 - Chung-Lun Li
, Zhi-Long Chen, T. C. Edwin Cheng:
A note on one-processor scheduling with asymmetric earliness and tardiness penalties. 45-48 - Yigal Gerchak, D. Marc Kilgour:
Sequential competitions with nondecreasing levels of difficulty. 49-58
Volume 13, Number 2, March 1993
- Vijaya Chandru, Chung-Yee Lee, Reha Uzsoy:
Minimizing total completion time on a batch processing machine with job families. 61-65 - James K. Ho, R. P. Sundarraj:
A timing model for the revised simplex method. 67-73 - J. Long, A. C. Williams:
On the number of local maxima in quadratic 0-1 programs. 75-78 - Jeroen B. J. M. De Kort:
Sensitivity analysis for symmetric 2-peripatetic salesman problems. 79-84 - Raj A. Sivakumar, Rajan Batta, Mark H. Karwan:
A network-based model for transporting extremely hazardous materials. 85-93 - X.-D. Hu:
A counterexample of the convergence of Rosen's algorithm with inexact line search. 95-97 - Ross Baldick:
Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints. 99-105 - Ivo J. B. F. Adan, Jaap Wessels, W. H. M. Zijm:
Matrix-geometric analysis of the shortest queue problem with threshold jockeying. 107-112 - Xi-Ren Cao:
Decomposition of random variables with bounded hazard rates. 113-120 - R. A. Danao:
On a class of semimonotone Q0-matrices in the linear complementarity problem. 121-125
Volume 13, Number 3, April 1993
- King-Tim Mak, Andrew J. Morton:
A modified Lin-Kernighan traveling-salesman heuristic. 127-132 - Gilbert Laporte, François V. Louveaux:
The integer L-shaped method for stochastic integer programs with complete recourse. 133-142 - Suvrajeet Sen:
Subgradient decomposition and differentiability of the recourse function of a two stage stochastic linear program. 143-148 - János Csirik, André van Vliet:
An on-line algorithm for multidimensional bin packing. 149-158 - Gautam M. Appa:
k-Integrality, an extension of total unimodularity. 159-163 - James Ledoux:
A necessary condition for weak lumpability in finite Markov processes. 165-168 - Toshikazu Kimura:
Duality between the Erlang loss system and a finite source queue. 169-173 - Indrajit Bardhan:
Diffusion approximations for GI/M/s queues with service interruptions. 175-182 - Lev M. Abolnikov, Jewgeni H. Dshalalow, Alexander M. Dukhovny:
A multilevel control bulk queueing system with vacationing server. 183-188 - Don Towsley:
A study of a queueing system with three-phase service. 189-195
Volume 13, Number 4, May 1993
- Leslie A. Hall, Robert J. Vanderbei:
Two-thirds is sharp for affine scaling. 197-201 - Nimrod Megiddo, Arie Tamir:
Linear time algorithms for some separable quadratic programming problems. 203-211 - J. B. G. Frenk, Martine Labbé, Shuzhong Zhang:
A note on a stochastic location problem. 213-214 - Jon Lee, Janny Leung:
A comparison of two edge-coloring formulations. 215-223 - Mark Hartmann, Todd Olmstead:
Solving sequential knapsack problems. 225-232 - Norman D. Curet:
A primal-dual simplex method for linear programs. 233-237 - Xavier de Groote, Evan L. Porteus:
An approach to single parameter process design. 239-245 - Douglas J. Morrice, Lee W. Schruben:
Simulation factor screening using cross-spectral methods. 247-257 - Izzet Sahin:
A generalization of renewal processes. 259-263
Volume 13, Number 5, June 1993
- Lee Schruben, Enver Yücesan:
Modeling paradigms for discrete event simulation. 265-275 - Russell A. Rushmeier, George L. Nemhauser:
Experiments with parallel branch-and-bound algorithms for the set covering problem. 277-285 - Meltem Denizel-Sivri, S. Selçuk Erengüç:
A polynomial algorithm for a multi-item capacitated production planning problem. 287-293 - Takahito Kuno:
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set. 295-303 - Roger L. Tobin, Terry L. Friesz, Nihal J. Mehta:
K-K-T multiploer estimates and objective function lower bounds from projective SUMT. 305-313 - Darko Skorin-Kapov:
On a cost allocation problem arising from a capacitated concentrator covering problem. 315-323 - Enrique Ballestero, Carlos Romero:
Weighting in compromise programming: A theorem on shadow prices. 325-329
a service of 
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-07-21 21:59 CEST 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:
