default search action
Mathematics of Operations Research, Volume 4
Volume 4, Number 1, February 1979
- C. B. García, Willard I. Zangwill:
Determining All Solutions to Certain Systems of Nonlinear Equations. 1-14 - Steven E. Shreve, Dimitri P. Bertsekas:
Universally Measurable Policies in Dynamic Programming. 15-30 - M. L. Balinski, H. Peyton Young:
Quotatone Apportionment Methods. 31-38 - Joyce J. Elam, Fred W. Glover
, Darwin Klingman:
A Strongly Convergent Primal Simplex Algorithm for Generalized Networks. 39-59 - Martin L. Puterman, Shelby L. Brumelle:
On the Convergence of Policy Iteration in Stationary Dynamic Programming. 60-69 - Helmut Schellhaas:
Semi-Regenerative Processes with Unbounded Rewards. 70-78 - Jean-Baptiste Hiriart-Urruty:
Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces. 79-97
Volume 4, Number 2, May 1979
- Pradeep Dubey, Lloyd S. Shapley:
Mathematical Properties of the Banzhaf Power Index. 99-131 - Michael O. Ball, George L. Nemhauser:
Matroids and a Reliability Analysis Problem. 132-143 - Eric V. Denardo, Uriel G. Rothblum:
Overtaking Optimality for Markov Decision Chains. 144-152 - Romesh Saigal:
On Piecewise Linear Approximations to Smooth Mappings. 153-161 - Robert E. Stanford:
Reneging Phenomena in Single Channel Queues. 162-178 - Ward Whitt:
Approximations of Dynamic Programs, II. 179-185 - Ernst-Wilhelm Zachow:
Expected Utility in Two-Person Games. 186-195 - W. H. Cunningham:
Theoretical Properties of the Network Simplex Method. 196-208
Volume 4, Number 3, August 1979
- Richard Asmuth, B. Curtis Eaves, Elmor L. Peterson:
Computing Economic Equilibria on Affine Networks with Lemke's Algorithm. 209-214 - Clyde L. Monma, Jeffrey B. Sidney:
Sequencing with Series-Parallel Precedence Constraints. 215-224 - Cyrus Derman, D. R. Smith:
Renewal Decision Problem-Random Horizon. 225-232 - Vasek Chvátal:
A Greedy Heuristic for the Set-Covering Problem. 233-235 - Abraham Neyman, Yair Tauman:
The Partition Value. 236-264 - Nimrod Megiddo, Zvi Galil:
On Fulkerson's Conjecture About Consistent Labeling Processes. 265-267 - O. L. Mangasarian:
Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs. 268-273 - Aram K. Kevorkian:
The Principal Maxmin Matrix Transversal Strategy. 274-290 - Shih-Ping Han:
Penalty Lagrangian Methods Via a Quasi-Newton Approach. 291-302
Volume 4, Number 4, November 1979
- Michael Maschler, Bezalel Peleg, L. S. Shapley:
Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts. 303-338 - Eugene L. Lawler:
Fast Approximation Algorithms for Knapsack Problems. 339-356 - Boris G. Pittel:
Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis. 357-378 - Klaus Truemper, Y. Soun:
Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks. 379-389 - C. B. García, Willard I. Zangwill:
An Approach to Homotopy and Degree Theory. 390-405 - Douglas R. Miller:
Almost Sure Comparisons of Renewal Processes and Poisson Processes, with Application to Reliability Theory. 406-413 - Nimrod Megiddo:
Combinatorial Optimization with Rational Objective Functions. 414-424 - Jonathan E. Spingarn, R. Tyrrell Rockafellar
The Generic Nature of Optimality Conditions in Nonlinear Programming. 425-430 - Lawrence D. Stone:
Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets. 431-440 - Luc Devroye:
Inequalities for the Completion Times of Stochastic PERT Networks. 441-447 - Sartaj Sahni, Yookun Cho:
Complexity of Scheduling Shops with No Wait in Process. 448-457 - Jacques Gauvin:
The Generalized Gradient of a Marginal Function in Mathematical Programming. 458-463 - Masakazu Kojima:
A Complementary Pivoting Approach to Parametric Nonlinear Programming. 464-477
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: