default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 7
Volume 7, Number 1, February 1982
- Gerard van der Laan, A. J. J. Talman:
On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games. 1-13 - Jean-Pierre Ponssard, Sylvain Sorin:
Optimal Behavioral Strategies In 0-Sum Games with Almost Perfect Information. 14-31 - Louis J. Billera, David C. Heath:
Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure. 32-39 - Leonard J. Mirman, Yair Tauman:
Demand Compatible Equitable Cost Sharing Prices. 40-56 - Teofilo F. Gonzalez:
Unit Execution Time Shop Problems. 57-66 - Manfred W. Padberg, M. R. Rao:
Odd Minimum Cut-Sets and b-Matchings. 67-80 - J. Scott Provan, Louis J. Billera:
Leontief Substitution Systems and Matroid Complexes. 81-87 - Ward Whitt:
Existence of Limiting Distributions in the GI/G/s Queue. 88-94 - Hidefumi Kawasaki:
A Duality Theorem in Multiobjective Nonlinear Programming. 95-110 - Benjamin Melamed:
On Markov Jump Processes Imbedded at Jump Epochs and Their Queueing-Theoretic Applications. 111-128 - Werner E. Helm, Rolf Schassberger:
Insensitive Generalized Semi-Markov Schemes with Point Process Input. 129-138 - Harvey Diamond:
Minimax Policies for Unobservable Inspections. 139-153 - Frank P. Kelly:
A Remark on Search and Sequencing Problems. 154-157
Volume 7, Number 2, May 1982
- Laurence Matthews:
Closure in Independence Systems. 159-171 - Alan M. Frieze
:
Algebraic Linear Programming. 172-182 - Arie Tamir, Eitan Zemel:
Locating Centers on a Tree with Discontinuous Supply and Demand Regions. 183-197 - Elon Kohlberg, John W. Pratt:
The Contraction Mapping Approach to the Perron-Frobenius Theory: Why Hilbert's Metric? 198-210 - D. Chan, Jong-Shi Pang:
The Generalized Quasi-Variational Inequality Problem. 211-222 - Benjamin Melamed:
Sojourn Times in Queueing Networks. 223-244 - Philip C. Jones, Earl S. Marwil:
Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems. 245-252 - Michael J. Todd:
On Minimum Volume Ellipsoids Containing Part of a Given Ellipsoid. 253-261 - J. F. C. Kingman:
Queue Disciplines in Heavy Traffic. 262-271 - Robert D. Doverspike, Carlton E. Lemke:
A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem. 272-294 - Ludo van der Heyden:
A Refinement Procedure for Computing Fixed Points Using Scarf's Primitive Sets. 295-313 - William H. Ruckle:
Projection in Certain Spaces of Set Functions. 314-318
Volume 7, Number 3, August 1982
- Shigeo Muto:
On Hart Production Games. 319-333 - Eugene L. Lawler, Charles U. Martel:
Computing Maximal "Polymatroidal" Network Flows. 334-347 - Peter C. Fishburn, Peter H. Farquhar:
Finite-Degree Utility Independence. 348-353 - N. Hefetz, Igal Adiri:
An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem. 354-360 - Robert P. Kertz:
Renewal Plans and Persistent Optimality in Countably Additive Gambling. 361-382 - Ludo van der Heyden:
Restricted Primitive Sets and Simplicial Subdivisions with Arbitrary Refinement Factors. 383-400 - Roy Radner, Robert W. Rosenthal:
Private Information and Pure-Strategy Equilibria. 401-409 - Laurence A. Wolsey:
Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems. 410-425 - Udo Lössner, Ingo Wegener:
Discrete Sequential Search with Positive Switch Cost. 426-440 - Karl Heinz Borgwardt:
Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method. 441-462 - Robin W. Chaney:
On Sufficient Conditions in Nonsmooth Optimization. 463-475 - Ehud Kalai, Eitan Zemel:
Totally Balanced Games and Games of Flow. 476-478
Volume 7, Number 4, November 1982
- Donald G. Saari:
Inconsistencies of Weighted Summation Voting Systems. 479-490 - William F. Lucas, M. Rabie:
Games with No Solutions and Empty Cores. 491-500 - Edward J. Anderson, P. Nash, Andrew B. Philpott:
A Class of Continuous Network Flow Problems. 501-514 - Gregory Dobson:
Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data. 515-531 - James O. Achugbue, Francis Y. L. Chin:
Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems. 532-544 - Daniel Granot, Frieda Granot, Ellis L. Johnson:
Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems. 545-556 - David Assaf:
Renewal Decisions when Category Life Distributions are of Phase-Type. 557-567 - Keigo Yamada:
Continuity Theorems in Stochastic Control Problems. 568-581 - Uriel G. Rothblum, Peter Whittle:
Growth Optimality for Branching Markov Decision Chains. 582-601 - Okitsugu Fujiwara:
Morse Programs: A Topological Approach to Smooth Constrained Optimization. 602-616 - Alvin E. Roth:
The Economics of Matching: Stability and Incentives. 617-628 - Peter C. Fishburn:
Moment-Preserving Shifts and Stochastic Dominance. 629-634 - Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Erratum. 635
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 2025-06-12 22:28 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:
