default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 3
Volume 3, Number 1, February 1978
- N. Z. Shapiro, Lloyd S. Shapley:
Values of Large Games, I: A Limit Theorem. 1-9 - Shelby L. Brumelle:
A Generalization of Erlang's Loss System to State Dependent Arrival and Service Rates. 10-16 - Masakazu Kojima:
Studies on Piecewise-Linear Approximations of Piecewise-C1 Mappings in Fixed Points and Complementarity Theory. 17-36 - Kees M. van Hee:
Markov Strategies in Dynamic Programming. 37-41 - Joseph B. Kadane:
A Characterization of the Rau Class of Sequential Problems. 42-56 - J. Michael Harrison, Sidney I. Resnick:
The Recurrence Classification of Risk and Storage Processes. 57-66 - Robert F. Anderson, Avner Friedman:
Optimal Inspections in a Stochastic Control Problem with Costly Observations, II. 67-81 - John M. Einbu:
Optimal Allocations of Continuous Resources to Several Activities with a Concave Return Function - Some Theoretical Results. 82-88
Volume 3, Number 2, May 1978
- David M. Stein:
An Asymptotic, Probabilistic Analysis of a Routing Problem. 89-101 - George B. Dantzig, Arthur F. Veinott Jr.:
Discovering Hidden Totally Leontief Substitution Systems. 102-103 - Truman Bewley, Elon Kohlberg:
On Stochastic Games with Stationary Optimal Strategies. 104-125 - Michael J. Todd:
On the Jacobian of a Function at a Zero Computed by a Fixed Point Algorithm. 126-132 - J. W. Cohen:
Properties of the Process of Level Crossings During a Busy Cycle of the M/G/1 Queueing System. 133-144 - Robert G. Jeroslow:
Some Basis Theorems for Integral Monoids. 145-154 - Richard W. Cottle, Jong-Shi Pang:
A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs. 155-170 - Shelby L. Brumelle:
Convex Operators and Supports. 171-175
Volume 3, Number 3, August 1978
- George L. Nemhauser, Laurence A. Wolsey:
Best Algorithms for Approximating the Maximum of a Submodular Set Function. 177-188 - Nimrod Megiddo:
Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree. 189-196 - Oscar H. Ibarra, Chul E. Kim:
Approximation Algorithms for Certain Scheduling Problems. 197-204 - Elja Arjas, Tapani Lehtonen:
Approximating Many Server Queues by Means of Single Server Queues. 205-223 - David W. Walkup:
The Hirsch Conjecture Fails for Triangulated 27-Spheres. 224-230 - Ward Whitt:
Approximations of Dynamic Programs, I. 231-243 - David F. Shanno:
Conjugate Gradient Methods with Inexact Searches. 244-256 - Robert James Weber:
Attainable Sets of Quasiconcave Markets, II: Convexifiable Sets. 257-264
Volume 3, Number 4, November 1978
- Roger B. Myerson:
Threat Equilibria and Fair Settlements in Cooperative Games. 265-274 - Richard E. Barlow, Alexander S. Wu:
Coherent Systems with Multi-State Components. 275-281 - C. B. García, Floyd J. Gould:
A Theorem on Homotopy Paths. 282-289 - J. W. Milnor, L. S. Shapley:
Values of Large Games II: Oceanic Games. 290-307 - Paul J. Schweitzer, Awi Federgruen:
The Functional Equations of Undiscounted Markov Renewal Programming. 308-321 - Alan Stickney, Layne T. Watson:
Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem. 322-333 - Bernard Monjardet:
An Axiomatic Theory of Tournament Aggregation. 334-351
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-10-31 20:15 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:
