default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 10
Volume 10, Number 1, February 1991
- Andrew C. Pan, Ranga V. Ramasesh, Jack C. Hayya, J. Keith Ord:
Multiple sourcing: The determination of lead times. 1-7 - Dominique de Werra, Jacek Blazewicz
, Wieslaw Kubiak:
A preemptive open shop scheduling problem with one resource. 9-15 - J. George Shanthikumar, Genji Yamazaki, Hirotaka Sakasegawa:
Characterization of optimal order of servers in a tandem queue with blocking. 17-22 - Takahito Kuno, Hiroshi Konno, Eitan Zemel:
A linear-time algorithm for solving continuous maximin knapsack problems. 23-26 - Martin Desrochers, Gilbert Laporte:
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. 27-36 - David L. Applegate, William J. Cook, S. Thomas McCormick:
Integral infeasibility and testing total dual integrality. 37-41 - C. W. Duin, A. Volgenant:
Minimum deviation and balanced optimization: A unified approach. 43-48 - Don Towsley, François Baccelli:
Comparisons of service disciplines in a tandem queueing network with real time constraints. 49-55 - James V. Burke, Michael C. Ferris:
Characterization of solution sets of convex programs. 57-60
Volume 10, Number 2, March 1991
- Hanif D. Sherali:
On the equivalence between some shortest path algorithms. 61-65 - Lawrence W. Robinson:
Baseball playoff eliminations: An application of linear programming. 67-74 - Krzysztof C. Kiwiel:
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization. 75-81 - José Claudio Geromel, Paulo Augusto Valente Ferreira:
An upper bound on properly efficient solutions in multiobjective optimization. 83-86 - David Fernández-Baca, S. Srinivasan:
Constructing the minimization diagram of a two-parameter problem. 87-93 - Zvi Rosberg, H. Richard Gail:
ASTA implies an M/G/1-like load decomposition for a server with vacations. 95-97 - Sudha Jain, James G. C. Templeton:
Confidence interval for M/M/2 queue with heterogeneous servers. 99-101 - Yves De Serres:
Simultaneous optimization of flow control and scheduling in a single server queue with two job classes. 103-112 - Michel X. Goemans, Kalyan T. Talluri:
2-Change for k-connected networks. 113-117
Volume 10, Number 3, April 1991
- R. Kipp Martin:
Using separation algorithms to generate mixed integer model reformulations. 119-128 - Jeremy F. Shapiro:
Convergent duality for the traveling salesman problem. 129-136 - Ubaldo M. García-Palomares, William Colmenares:
On the minimization of a quasi-concave function subject to linear constraints. 137-141 - Ariel Orda, Raphael Rom:
Location of central nodes in time varying computer networks. 143-152 - Jianzhong Du, Joseph Y.-T. Leung:
Minimizing the number of late jobs on unrelated machines. 153-158 - Eugeniusz Toczylowski, Krzysztof Pienkosz:
Restrictive aggregation of items in multi-stage production systems. 159-163 - Francis J. Nourie, Enrique R. Venta:
Finding optimal line balances with OptPack. 165-171 - Joseph F. Pekny, Donald L. Miller, Daniel Stodolsky:
A note on exploiting the Hamiltonian cycle problem substructure of the Asymmetric Traveling Salesman Problem. 173-176 - Zyukiti Ikeda:
Mean waiting time of a Gamma/Gamma/1 queue. 177-181
Volume 10, Number 4, June 1991
- Hanan Luss:
A nonlinear minimax allocation problem with multiple knapsack constraints. 183-187 - S. Zhang:
On anti-cycling pivoting rules for the simplex method. 189-192 - Meir Herzberg, Uri Yechiali:
Criteria for selecting the relaxation factor of the value iteration algorithm for undiscounted Markov and semi-Markov decision processes. 193-202 - Harold P. Benson, Yasemin Aksoy:
Using efficient feasible directions in interactive multiple objective linear programming. 203-209 - Horst W. Hamacher, Franz Rendl:
Color constrained combinatorial optimization problems. 211-219 - Katarína Cechlárová:
The uniquely solvable bipartite matching problem. 221-224 - Hideaki Takagi, Yoshitaka Takahashi:
Priority queues with batch Poisson arrivals. 225-232 - Anat Levy, Hanoch Levy:
Lock and no-lock mortgage plans: Is it only a matter of risk shifting? 233-240 - Frank K. Hwang, Yi-Ching Yao:
A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization. 241-243
Volume 10, Number 5, July 1991
- Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise:
A unified approach to interior point algorithms for linear complementarity problems: A summary. 247-254 - Bennett L. Fox, David Goldsman, James J. Swain:
Spaced batch means. 255-263 - Bharat Doshi:
Analysis of a two phase queueing system with general service times. 265-272 - Susan H. Xu:
Minimizing expected makespans of multi-priority classes of jobs on uniform processors. 273-280 - Chris N. Potts, David B. Shmoys, David P. Williamson:
Permutation vs. non-permutation flow shop schedules. 281-284 - Douglas A. Miller, Steven W. Zucker:
Copositive-plus Lemke algorithm solves polymatrix games. 285-290 - J. A. Hoogeveen:
Analysis of Christofides' heuristic: Some paths are more difficult than cycles. 291-295 - Y. June Wu, J. David Fuller:
Convergence of multiperiod equilibrium calculations, with geometric distributed lag demand. 297-302 - Rainer E. Burkard, Franz Rendl:
Lexicographic bottleneck problems. 303-308
Volume 10, Number 6, August 1991
- J. R. Rajasekera, Shu-Cherng Fang:
On the convex programming approach to linear programming. 309-312 - Jeremy P. Spinrad:
Note on recognition of matroid systems. 313-314 - George L. Nemhauser, Sungsoo Park:
A polyhedral approach to edge coloring. 315-322 - Le Dung Muu, Werner Oettli:
An algorithm for indefinite quadratic programming with convex constraints. 323-327 - Kelly J. Hayhurst, Douglas R. Shier:
A factoring approach for the stochastic shortest path problem. 329-334 - David Perry, Morton J. M. Posner:
Determining the control limit policy in a replacement model with linear restoration. 335-341 - Nico M. van Dijk:
'Stop = recirculate' for exponential product form queueing networks with departure blocking. 343-351 - Don Towsley, Satish K. Tripathi:
A single server priority queue with server failures and queue flushing. 353-362 - Hanoch Levy:
A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems. 363-368
Volume 10, Number 7, October 1991
- Lan Zhao, Stella Dafermos:
General economic equilibrium and variational inequalities. 369-376 - A. M. H. Gerards:
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus. 377-382 - Donald Goldfarb, Jianxiu Hao:
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem. 383-387 - John A. Kaliski, Yinyu Ye:
Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program. 389-393 - Refael Hassin, Arie Tamir:
Improved complexity bounds for location problems on the real line. 395-402 - Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard:
On-line and off-line vertex enumeration by adjacency lists. 403-409 - Alain Hertz:
Cosine: A new graph coloring algorithm. 411-415 - Krzysztof Dudzinski:
A note on dominance relation in unbounded knapsack problems. 417-419 - Enrique Ballestero, Carlos Romero:
A theorem connecting utility function optimization and compromise programming. 421-427 - Lawrence W. Robinson:
Baseball playoff eliminations: An application of linear programming. 429
Volume 10, Number 8, November 1991
- Peter W. Glynn, Ward Whitt:
Estimating the asymptotic variance with batch means. 431-435 - Peter W. Glynn, Philip Heidelberger:
Analysis of initial transient deletion for replicated steady-state simulations. 437-443 - Pirooz Vakili:
Using a standard clock technique for efficient simulation. 445-452 - Jhitti Chiarawongse, Mandyam M. Srinivasan:
On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals. 453-459 - Yahya Fathi:
SQVAM: A variance minimizing algorithm. 461-466 - Nicholas G. Hall, Wieslaw Kubiak:
Proof of a conjecture of Schrage about the completion time variance problem. 467-472 - Eugeniusz Nowicki, Czeslaw Smutnicki:
Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling. 473-480 - Harold P. Benson:
Complete efficiency and the initialization of algorithms for multiple objective programming. 481-487 - Nam-kee Chung, Dong-wan Tcha:
A dual algorithm for submodular flow problems. 489-495
Volume 10, Number 9, December 1991
- Thomas Christof, Michael Jünger, Gerhard Reinelt:
A complete description of the traveling salesman polytope on 8 nodes. 497-500 - S. Huang, Kenneth O. Kortanek:
A note on a potential reduction algorithm for LP with simultaneous primal-dual updating. 501-507 - Esther Frostig:
On the optimality of static policy in stochastic open shop. 509-512 - G. E. Martin:
Negotiated price discounting of perishable inventories. 513-518 - Stanislaw Zdrzalka:
Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis. 519-523 - Ravi Varadarajan:
An optimal algorithm for 2 × n bottleneck transportation problems. 525-529 - Robert J. Vanderbei:
A brief description of ALPO. 531-534 - Tetsuya Takine, Toshiharu Hasegawa:
Average waiting time of a symmetric polling system under Bernoulli scheduling. 535-539 - Yves Dallery, Don Towsley:
Symmetry property of the throughput in closed tandem queueing networks with finite buffers. 541-547
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-11-04 20:32 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:
