default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 2
Volume 2, Number 1, February 1977
- Arie Hordijk, Karel Sladký:
Sensitive Optimality Criteria in Countable State Dynamic Programming. 1-14 - Egon Balas, Eitan Zemel:
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes. 15-19 - Eric V. Denardo:
Periods of Connected Networks and Powers of Nonnegative Matrices. 20-24 - C. B. García:
Computation of Solutions to Nonlinear Equations Under Homotopy Invariance. 25-29 - Peter C. Fishburn:
Approximations of Two-Attribute Utility Functions. 30-44 - David M. Kreps:
Decision Problems with Expected Utility Critera, I: Upper and Lower Convergent Utility. 45-53 - J. Michael Harrison:
Some Stochastic Bounds for Dams and Queues. 54-63 - Alvin E. Roth:
Individual Rationality and Nash's Solution to the Bargaining Problem. 64-65 - Laurence A. Wolsey:
Valid Inequalities and Superadditivity for 0-1 Integer Programs. 66-77 - Richard M. Feldman:
Optimal Replacement with Semi-Markov Shock Models Using Discounted Costs. 78-90 - Jacob Wijngaard:
Stationary Markovian Decision Problems and Perturbation Theory of Quasi-Compact Linear Operators. 91-102
Volume 2, Number 2, May 1977
- Robert G. Bland:
New Finite Pivoting Rules for the Simplex Method. 103-107 - Romesh Saigal:
On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting. 108-124 - Lester E. Dubins, William D. Sudderth:
Persistently ϵ-Optimal Strategies. 125-134 - Adrian E. Eckberg Jr.:
Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems. 135-142 - Alan Tucker:
A Note on Convergence of the Ford-Fulkerson Flow Algorithm. 143-144 - Henry M. Goldberg:
Analysis of the Earliest Due Date Scheduling Rule in Queueing Systems. 145-154 - Robert F. Anderson, Avner Friedman:
Optimal Inspections in a Stochastic Control Problem with Costly Observations. 155-190 - Robert Mifflin:
An Algorithm for Constrained Optimization with Semismooth Functions. 191-207
Volume 2, Number 3, August 1977
- Richard M. Karp:
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane. 209-224 - Roger B. Myerson:
Graphs and Cooperation in Games. 225-229 - Richard D. Wollmer:
A Substitute Inverse for the Basis of a Staircase Structure Linear Program. 230-239 - Seraphin B. Calo, S. C. Schwartz:
An Upper Bound for the Equilibrium Mean Wait in a Stationary GI/G/1 Queue. 240-243 - R. G. Vickson:
Stochastic Orderings from Partially Known Utility Functions. 244-252 - Jean-Philippe Vial, Israel Zang:
Unconstrained Optimization by Approximation of the Gradient Path. 253-265 - David M. Kreps:
Decision Problems with Expected Utility Criteria, II: Stationarity. 266-274 - Peter Brucker, Michael R. Garey, David S. Johnson:
Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness. 275-284 - F. Di Guglielmo:
Nonconvex Duality in Multiobjective Optimization. 285-291 - Brian K. Schmidt, T. H. Mattheiss:
The Probability that a Random Polytope is Bounded. 292-296
Volume 2, Number 4, November 1977
- J. W. Cohen, Michael Rubinovitch:
On Level Crossings and Cycles in Dam Processes. 297-310 - Elmor L. Peterson:
The Duality between Suboptimization and Parameter Deletion. 311-319 - Ravi Sethi:
On the Complexity of Mean Flow Time Scheduling. 320-330 - Yair Tauman:
A Nondiagonal Value on a Reproducing Space. 331-337 - Abraham Neyman:
Continuous Values are Diagonal. 338-342 - Willard I. Zangwill:
An Eccentric Barycentric fixed Point Algorithm. 343-359 - Paul J. Schweitzer, Awi Federgruen:
The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems. 360-381 - Stephen M. Robinson:
Acknowledgment. 382
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 2026-04-19 21:48 CEST 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:
