default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 17
Volume 17, Number 1, February 1995
- Michael O. Ball, Feng L. Lin:
Reliability, covering and balanced matrices. 1-7 - Martine Labbé
, Gilbert Laporte, Silvano Martello:
An exact algorithm for the dual bin packing problem. 9-18 - Hanif D. Sherali, Youngho Lee, Warren P. Adams:
A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope. 19-26 - Ariel Orda, Raphael Rom:
On continuous network flows. 27-36 - Bengt Aspvall, Sjur Didrik Flåm, Kåre Villanger:
Selecting among scheduled projects. 37-40 - Refael Hassin, Moshe Haviv:
Equilibrium strategies for queues with impatient customers. 41-45 - Xiuli Chao:
Monotone effect of dependency between interarrival and service times in a simple queueing system. 47-51
Volume 17, Number 2, March 1995
- Rainer E. Burkard:
On the role of bottleneck Monge matrices in combinatorial optimization. 53-56 - Hsin-Der Chen, Donald W. Hearn, Chung-Yee Lee:
Minimizing the error bound for the dynamic lot size model. 57-68 - I. Z. Milis, Vangelis F. Magirou:
A Lagrangian relaxation algorithm for sparse quadratic assignment problems. 69-76 - Michael A. Zazanis:
Derivative estimation via stochastic intensities: Event averages in queueing systems. 77-84 - Mikhail Y. Kovalyov:
Improving the complexities of approximation algorithms for optimization problems. 85-87 - Nathaniel Dean, Monika Mevenkamp, Clyde L. Monma:
NETPAD: An interactive graphics system for network modeling and optimization. 89-101
Volume 17, Number 3, April 1995
- Dorit S. Hochbaum:
A nonlinear Knapsack problem. 103-110 - Dimitri P. Bertsekas:
Generic rank-one corrections for value iteration in Markovian decision problems. 111-119 - Ulf Brännlund, Krzysztof C. Kiwiel, Per Olov Lindberg:
A descent proximal level bundle method for convex nondifferentiable optimization. 121-126 - Zhi-Long Chen:
A note on single-processor scheduling with time-dependent execution times. 127-129 - Francisco Facchinei:
Minimization of SC1 functions and the Maratos effect. 131-137 - Sheldon H. Jacobson:
How difficult is the frequency selection problem? 139-147 - José A. Ventura, Michael X. Weng:
An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date. 149-152
Volume 17, Number 4, May 1995
- Frank K. Hwang, Uriel G. Rothblum:
Assembly at system level versus component level. 153-157 - Hamilton Emmons, Kamlesh Mathur:
Lot sizing in a no-wait flow shop. 159-164 - Douglas J. Morrice:
A comparison of frequency domain methodology and conventional factor screening methods. 165-174 - William R. Allen:
An improved bound for the multifacility location model. 175-180 - Xiaojie Xu, Yinyu Ye:
A generalized homogeneous and self-dual algorithm for linear programming. 181-190 - Jesus R. Artalejo:
A queueing system with returning customers and waiting line. 191-199
Volume 17, Number 5, June 1995
- David Hartvigsen, François Margot:
Multiterminal flows and cuts. 201-204 - J. A. Hoogeveen, Steef L. van de Velde:
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. 205-208 - Stephen A. Vavasis, Yinyu Ye:
Condition numbers for polyhedra with real number data. 209-214 - Thai Quynh Phong, Le Thi Hoai An, Pham Dinh Tao:
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems. 215-220 - S. Chang, Qing Lu, Guochun Tang, W. Yu:
On decomposition of the total tardiness problem. 221-229 - Mehran Hojati:
The network synthesis problem in a cycle. 231-236 - Xiuli Chao, Michael L. Pinedo:
Networks of queues with batch services, signals and product form solutions. 237-242 - T. C. Edwin Cheng, Mikhail Y. Kovalyov:
Single machine batch scheduling with deadlines and resource dependent processing times. 243-249
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-12-22 19:01 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:
