default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 16
Volume 16, Number 1, August 1994
- Bruce W. Schmeiser, Michael R. Taaffe:
Time-dependent queueing network approximations as simulation external control variates. 1-9 - Shoshana Anily, Gur Mosheiov:
The traveling salesman problem with delivery and backhauls. 11-18 - Wansoo T. Rhee:
Boundary effects in the traveling salesperson problem. 19-25 - Wansoo T. Rhee:
On the fluctuations of simple matching. 27-32 - Naoki Makimoto, Ikuo Nakagawa, Akihisa Tamura:
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane. 33-40 - Kyung C. Chae, Tae-Sung Kim:
Reversed absorbing Markov chain: A simple path approach. 41-46 - Pranay Chaudhuri:
Finding maximum matching for bipartite graphs in parallel. 47-49 - De-Ron Liang, Rong-Hong Jan:
Reliability analysis of a simple replicated and-fork/and-join graph. 51-59
Volume 16, Number 2, September 1994
- Shinji Mizuno:
A predictor-corrector infeasible-interior-point algorithm for linear programming. 61-66 - Aaron Melman
:
A new linesearch method for quadratically constrained convex programming. 67-77 - Dorit S. Hochbaum, Dan Landy:
Scheduling with batching: minimizing the weighted number of tardy jobs. 79-86 - Erick D. Wikum, Donna Crystal Llewellyn, George L. Nemhauser:
One-machine generalized precedence constrained scheduling problems. 87-99 - Kenneth D. Boese, Andrew B. Kahng, Sudhakar Muddu:
A new adaptive multi-start technique for combinatorial global optimizations. 101-113 - S. Kalpakam, K. P. Sapna:
Continuous review (s, S) inventory system with random lifetimes and positive leadtimes. 115-119
Volume 16, Number 3, October 1994
- Hsin-Der Chen, Panos M. Pardalos, Michael A. Saunders:
The simplex algorithm with a new primal and dual pivot rule. 121-127 - J. A. Hoogeveen, Jan Karel Lenstra, Bart Veltman:
Three, four, five, six, or the complexity of scheduling with communication delays. 129-137 - Robin Lougee-Heimer, Warren P. Adams, Douglas R. Shier:
Some applications of nonnegative linear systems: Farkas strikes again. 139-147 - Chung-Yee Lee, George L. Vairaktarakis:
Minimizing makespan in hybrid flowshops. 149-158 - Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar:
New characterizations of ℓ1 solutions to overdetermined systems of linear equations. 159-166 - Shaul K. Bar-Lev, Mahmut Parlar, David Perry:
On the EOQ model with inventory-level-dependent demand rate and random yield. 167-176 - Karin Aarssen, Nico M. van Dijk:
A note on jackson networks with state-dependent rejection probabilities. 177-181
Volume 16, Number 4, November 1994
- Michel X. Goemans, David P. Williamson:
Approximating minimum-cost graph problems with spanning tree edges. 183-189 - Svatopluk Poljak, Zsolt Tuza:
The expected relative error of the polyhedral approximation of the max-cut problem. 191-198 - Awi Federgruen, Gur Mosheiov:
Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs. 199-208 - George S. Fishman:
Choosing sample path length and number of sample paths when starting in steady state. 209-219 - Bo Chen, André van Vliet, Gerhard J. Woeginger:
New lower and upper bounds for on-line scheduling. 221-230 - Seong-In Kim, In-Chan Choi:
A simple variational problem for a moving vehicle. 231-239 - Wen Lea Pearn:
Solvable cases of the k-person Chinese postman problem. 241-244
Volume 16, Number 5, December 1994
- Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger:
Monge matrices make maximization manageable. 245-254 - George L. Nemhauser, Pamela H. Vance:
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints. 255-263 - Michael Patriksson:
On the convergence of descent methods for monotone variational inequalities. 265-269 - Jay B. Ghosh:
Batch scheduling to minimize total completion time. 271-275 - Joanna Józefowska, Bernd Jurisch, Wieslaw Kubiak:
Scheduling shops to minimize the weighted number of late jobs. 277-283 - Zohel Khalil, Gennadi Falin:
Stochastic inequalities for M/G/1 retrial queues. 285-290 - Igor Averbakh, Oded Berman:
Categorized bottleneck-minisum path problems on networks. 291-297 - Julian Scott Yeomans:
A comment on "A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems". 299-301
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:
