Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 9
Volume 9, Number 1, February 1984
- Egon Balas:
A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers. 1-5 - Uriel G. Rothblum:
Multiplicative Markov Decision Chains. 6-24 - Dov Samet, Yair Tauman, Israel Zang:
An Application of the Aumann-Shapley Prices for Cost Allocation in Transportation Problems. 25-42 - Gerald G. Brown, Bruno O. Shubert:
On Random Binary Trees. 43-65 - Leonard J. Mirman, Abraham Neyman:
Diagonality of Cost Allocation Prices. 66-74 - Charles D. Feinstein, Shmuel S. Oren:
A Newton-Type Algorithm for the Solution of the Implicit Programming Problem. 75-86 - Jean-Pierre Aubin:
Lipschitz Behavior of Solutions to Convex Minimization Problems. 87-111 - Arie Hordijk, Frank A. Van der Duyn Schouten:
Discretization and Weak Convergence in Markov Decision Drift Processes. 112-141 - Richard Loulou:
Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling. 142-150 - Elja Arjas, Ilkka Norros:
Life Lengths and Association: A Dynamic Approach. 151-158
Volume 9, Number 2, May 1984
- Alexander D. Ioffe:
Necessary Conditions in Nonsmooth Optimization. 159-189 - James B. Orlin:
Minimum Convex Cost Dynamic Network Flows. 190-207 - Bernhard Gollan:
On The Marginal Function in Nonlinear Programming. 208-221 - Edward J. Anderson
, Andrew B. Philpott:
Duality and an Algorithm for a Class of Continuous Transportation Problems. 222-231 - John M. Einbu:
A Finite Method for the Solution of a Multi-Resource Allocation Problem with Concave Return Functions. 232-243 - Michael J. Magazine, Maw-Sheng Chern:
A Note on Approximation Schemes for Multidimensional Knapsack Problems. 244-247 - George Steiner:
Single Machine Scheduling with Precedence Constraints of Dimension 2. 248-259 - Edward G. Coffman Jr., Greg N. Frederickson, George S. Lueker:
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors. 260-266 - Erik J. Balder:
A Unifying Note on Fatou's Lemma in Several Dimensions. 267-275 - Arie Hordijk, Lodewijk C. M. Kallenberg:
Constrained Undiscounted Stochastic Dynamic Programming. 276-289 - Jan van der Wal:
On Stationary Strategies in Countable State Total Reward Markov Decision Processes. 290-300 - Refael Hassin, Mordechai I. Henig:
Dichotomous Search for Random Objects on an Interval. 301-308 - Dov Samet, Eitan Zemel:
On the Core and Dual Set of Linear Programming Games. 309-316
Volume 9, Number 3, August 1984
- Awi Federgruen, Paul J. Schweitzer:
Successive Approximation Methods for Solving Nested Functional Equations in Markov Decision Problems. 319-344 - Charles E. Blair:
Axioms and Examples Related to Ordinal Dynamic Programming. 345-347 - Zvi Artstein:
Convergence Rates for the Optimal Values of Allocation Processes. 348-355 - Jerzy A. Filar, T. E. S. Raghavan:
A Matrix Game Solution of the Single-Controller Stochastic Game. 356-362 - B. Curtis Eaves, James A. Yorke:
Equivalence of Surface Density and Average Directional Density. 363-375 - Wen-Lian Hsu:
Approximation Algorithms for the Assembly Line Crew Scheduling Problem. 376-383 - Edward G. Coffman Jr., Mihalis Yannakakis:
Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum. 384-390 - James C. Bean, Robert L. Smith:
Conditions for the Existence of Planning Horizons. 391-401 - Paul H. Zipkin:
On the Imbalance of Inventories in Multi-Echelon Systems. 402-423 - Haya Kaspi:
Storage Processes with Markov Additive Input and Output. 424-440 - Martin I. Reiman:
Open Queueing Networks in Heavy Traffic. 441-458 - Keigo Yamada:
Diffusion Approximations for Storage Processes with General Release Rules. 459-470 - Dov Samet:
Vector Measures Are Open Maps. 471-474 - George L. O'Brien:
Stochastic Dominance and Moment Inequalities. 475-477
Volume 9, Number 4, November 1984
- Robert M. Freund:
Variable Dimension Complexes Part I: Basic Theory. 479-497 - Robert M. Freund:
Variable Dimension Complexes Part II: A Unified Approach to Some Combinatorial Lemmas in Topology. 498-509 - Ushio Sumita:
The Laguerre Transform and a Family of Functions with Nonnegative Laguerre Coefficients. 510-521 - Richard F. Serfozo:
Thinning of Cluster Processes: Convergence of Sums of Thinned Point Processes. 522-533 - Ward Whitt:
Departures from a Queue with Many Busy Servers. 534-544 - Norman Schofield:
Existence of Equilibrium on a Manifold. 545-557 - Hans Deppe:
On the Existence of Average Optimal Policies in Semiregenerative Decision Models. 558-575 - L. McLinden:
A Minimax Theorem. 576-591 - Jack Warga:
Iterative Optimization with Equality Constraints. 592-605 - Mohamed Abdel-Hameed:
Life Distribution Properties of Devices Subject to a Lévy Wear Process. 606-614 - Michael N. Katehakis, Cyrus Derman:
Optimal Repair Allocation in a Series System. 615-623 - Daryl J. Daley, Tomasz Rolski:
A Light Traffic Approximation for a Single-Server Queue. 624-628 - M. L. Balinski:
The Hirsch Conjecture for Dual Transportation Polyhedra. 629-633 - Ward Whitt:
Erratum. 634
a service of 
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-04-17 21:31 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:
