External Links

    Journal: Math. Oper. Res.

    Volume 4, Issue 4

    303 -- 338M. Maschler, B. Peleg, L. S. Shapley. Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
    339 -- 356Eugene L. Lawler. Fast Approximation Algorithms for Knapsack Problems
    357 -- 378B. Pittel. Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
    379 -- 389K. Truemper, Y. Soun. Minimal Forbidden Subgraphs of Unimodular Multicommodity Networks
    390 -- 405C. B. García, Willard I. Zangwill. An Approach to Homotopy and Degree Theory
    406 -- 413Douglas R. Miller. Almost Sure Comparisons of Renewal Processes and Poisson Processes, with Application to Reliability Theory
    414 -- 424Nimrod Megiddo. Combinatorial Optimization with Rational Objective Functions
    425 -- 430Jonathan E. Spingarn, R. Tyrrell Rockafellar. The Generic Nature of Optimality Conditions in Nonlinear Programming
    431 -- 440Lawrence D. Stone. Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets
    441 -- 447Luc P. Devroye. Inequalities for the Completion Times of Stochastic PERT Networks
    448 -- 457Sartaj Sahni, Yookun Cho. Complexity of Scheduling Shops with No Wait in Process
    458 -- 463Jacques Gauvin. The Generalized Gradient of a Marginal Function in Mathematical Programming
    464 -- 477Masakazu Kojima. A Complementary Pivoting Approach to Parametric Nonlinear Programming

    Volume 4, Issue 3

    209 -- 214Richard Asmuth, B. Curtis Eaves, Elmor L. Peterson. Computing Economic Equilibria on Affine Networks with Lemke's Algorithm
    215 -- 224Clyde L. Monma, Jeffrey B. Sidney. Sequencing with Series-Parallel Precedence Constraints
    225 -- 232Cyrus Derman, D. R. Smith. Renewal Decision Problem-Random Horizon
    233 -- 235Vasek Chvatal. A Greedy Heuristic for the Set-Covering Problem
    236 -- 264Abraham Neyman, Yair Tauman. The Partition Value
    265 -- 267Nimrod Megiddo, Zvi Galil. On Fulkerson's Conjecture About Consistent Labeling Processes
    268 -- 273O. L. Mangasarian. Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
    274 -- 290Aram K. Kevorkian. The Principal Maxmin Matrix Transversal Strategy
    291 -- 302Shih-Ping Han. Penalty Lagrangian Methods Via a Quasi-Newton Approach

    Volume 4, Issue 2

    99 -- 131Pradeep Dubey, Lloyd S. Shapley. Mathematical Properties of the Banzhaf Power Index
    132 -- 143Michael O. Ball, George L. Nemhauser. Matroids and a Reliability Analysis Problem
    144 -- 152Eric V. Denardo, Uriel G. Rothblum. Overtaking Optimality for Markov Decision Chains
    153 -- 161R. Saigal. On Piecewise Linear Approximations to Smooth Mappings
    162 -- 178Robert E. Stanford. Reneging Phenomena in Single Channel Queues
    179 -- 185Ward Whitt. Approximations of Dynamic Programs, II
    186 -- 195Ernst-Wilhelm Zachow. Expected Utility in Two-Person Games
    196 -- 208W. H. Cunningham. Theoretical Properties of the Network Simplex Method

    Volume 4, Issue 1

    1 -- 14C. B. García, Willard I. Zangwill. Determining All Solutions to Certain Systems of Nonlinear Equations
    15 -- 30Steven E. Shreve, Dimitri P. Bertsekas. Universally Measurable Policies in Dynamic Programming
    31 -- 38M. L. Balinski, H. P. Young. Quotatone Apportionment Methods
    39 -- 59Joyce J. Elam, Fred Glover, Darwin Klingman. A Strongly Convergent Primal Simplex Algorithm for Generalized Networks
    60 -- 69Martin L. Puterman, Shelby L. Brumelle. On the Convergence of Policy Iteration in Stationary Dynamic Programming
    70 -- 78Helmut Schellhaas. Semi-Regenerative Processes with Unbounded Rewards
    79 -- 97Jean-Baptiste Hiriart-Urruty. Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
    runs on