share record
persistent URL:
Horst W. Hamacher , Franz Rendl : Color constrained combinatorial optimization problems. Oper. Res. Lett. 10 (4 ) : 211-219 (1991 )share record
persistent URL:
Refael Hassin , Arie Tamir : Improved complexity bounds for location problems on the real line. Oper. Res. Lett. 10 (7 ) : 395-402 (1991 )share record
persistent URL:
Kelly J. Hayhurst , Douglas R. Shier : A factoring approach for the stochastic shortest path problem. Oper. Res. Lett. 10 (6 ) : 329-334 (1991 )share record
persistent URL:
Alain Hertz : Cosine: A new graph coloring algorithm. Oper. Res. Lett. 10 (7 ) : 411-415 (1991 )share record
persistent URL:
Meir Herzberg , Uri Yechiali : Criteria for selecting the relaxation factor of the value iteration algorithm for undiscounted Markov and semi-Markov decision processes. Oper. Res. Lett. 10 (4 ) : 193-202 (1991 )share record
persistent URL:
J. A. Hoogeveen : Analysis of Christofides' heuristic: Some paths are more difficult than cycles. Oper. Res. Lett. 10 (5 ) : 291-295 (1991 )share record
persistent URL:
S. Huang , Kenneth O. Kortanek : A note on a potential reduction algorithm for LP with simultaneous primal-dual updating. Oper. Res. Lett. 10 (9 ) : 501-507 (1991 )share record
persistent URL:
Frank K. Hwang , Yi-Ching Yao : A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization. Oper. Res. Lett. 10 (4 ) : 241-243 (1991 )share record
persistent URL:
Zyukiti Ikeda : Mean waiting time of a Gamma/Gamma/1 queue. Oper. Res. Lett. 10 (3 ) : 177-181 (1991 )share record
persistent URL:
Sudha Jain , James G. C. Templeton : Confidence interval for M/M/2 queue with heterogeneous servers. Oper. Res. Lett. 10 (2 ) : 99-101 (1991 )share record
persistent URL:
John A. Kaliski , Yinyu Ye : Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program. Oper. Res. Lett. 10 (7 ) : 389-393 (1991 )share record
persistent URL:
Krzysztof C. Kiwiel : A tilted cutting plane proximal bundle method for convex nondifferentiable optimization. Oper. Res. Lett. 10 (2 ) : 75-81 (1991 )share record
persistent URL:
Masakazu Kojima , Nimrod Megiddo , Toshihito Noma , Akiko Yoshise : A unified approach to interior point algorithms for linear complementarity problems: A summary. Oper. Res. Lett. 10 (5 ) : 247-254 (1991 )share record
persistent URL:
Takahito Kuno , Hiroshi Konno , Eitan Zemel : A linear-time algorithm for solving continuous maximin knapsack problems. Oper. Res. Lett. 10 (1 ) : 23-26 (1991 )share record
persistent URL:
Hanoch Levy : A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems. Oper. Res. Lett. 10 (6 ) : 363-368 (1991 )share record
persistent URL:
Anat Levy , Hanoch Levy : Lock and no-lock mortgage plans: Is it only a matter of risk shifting? Oper. Res. Lett. 10 (4 ) : 233-240 (1991 )share record
persistent URL:
Hanan Luss : A nonlinear minimax allocation problem with multiple knapsack constraints. Oper. Res. Lett. 10 (4 ) : 183-187 (1991 )share record
persistent URL:
R. Kipp Martin : Using separation algorithms to generate mixed integer model reformulations. Oper. Res. Lett. 10 (3 ) : 119-128 (1991 )share record
persistent URL:
G. E. Martin : Negotiated price discounting of perishable inventories. Oper. Res. Lett. 10 (9 ) : 513-518 (1991 )share record
persistent URL:
Douglas A. Miller , Steven W. Zucker : Copositive-plus Lemke algorithm solves polymatrix games. Oper. Res. Lett. 10 (5 ) : 285-290 (1991 )share record
persistent URL:
Le Dung Muu , Werner Oettli : An algorithm for indefinite quadratic programming with convex constraints. Oper. Res. Lett. 10 (6 ) : 323-327 (1991 )export record
dblp key:
journals/orl/NemhauserP91 share record
persistent URL:
George L. Nemhauser , Sungsoo Park : A polyhedral approach to edge coloring. Oper. Res. Lett. 10 (6 ) : 315-322 (1991 )share record
persistent URL:
Francis J. Nourie , Enrique R. Venta : Finding optimal line balances with OptPack. Oper. Res. Lett. 10 (3 ) : 165-171 (1991 )share record
persistent URL:
Eugeniusz Nowicki , Czeslaw Smutnicki : Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling. Oper. Res. Lett. 10 (8 ) : 473-480 (1991 )share record
persistent URL:
Ariel Orda , Raphael Rom : Location of central nodes in time varying computer networks. Oper. Res. Lett. 10 (3 ) : 143-152 (1991 )share record
persistent URL:
Andrew C. Pan , Ranga V. Ramasesh , Jack C. Hayya , J. Keith Ord : Multiple sourcing: The determination of lead times. Oper. Res. Lett. 10 (1 ) : 1-7 (1991 )share record
persistent URL:
Joseph F. Pekny , Donald L. Miller , Daniel Stodolsky : A note on exploiting the Hamiltonian cycle problem substructure of the Asymmetric Traveling Salesman Problem. Oper. Res. Lett. 10 (3 ) : 173-176 (1991 )share record
persistent URL:
David Perry , Morton J. M. Posner : Determining the control limit policy in a replacement model with linear restoration. Oper. Res. Lett. 10 (6 ) : 335-341 (1991 )share record
persistent URL:
Chris N. Potts , David B. Shmoys , David P. Williamson : Permutation vs. non-permutation flow shop schedules. Oper. Res. Lett. 10 (5 ) : 281-284 (1991 )export record
dblp key:
journals/orl/RajasekeraF91 share record
persistent URL:
J. R. Rajasekera , Shu-Cherng Fang : On the convex programming approach to linear programming. Oper. Res. Lett. 10 (6 ) : 309-312 (1991 )