default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 8
Volume 8, Number 1, February 1983
- D. S. Johnson, K. A. Niemi:
On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees. 1-14 - David Y. Burman, Donald R. Smith:
A Light-Traffic Theorem for Multi-Server Queues. 15-25 - Reuven Y. Rubinstein:
Smoothed Functionals in Stochastic Optimization. 26-33 - Julián Aráoz, Jack Edmonds, Victor J. Griffin:
Polarities Given by Systems of Bilinear Inequalities. 34-41 - J. C. Lagarias, F. Aminzadeh:
Multi-Stage Planning and the Extended Linear-Quadratic-Gaussian Control Problem. 42-63 - Jonathan M. Borwein:
On the Existence of Pareto Efficient Points. 64-73 - Alan F. Karr:
Extreme Points of Certain Sets of Probability Measures, with Applications. 74-85 - Gerard van der Laan, A. J. J. Talman:
Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level. 86-99 - Tibor Fiala:
An Algorithm for the Open-Shop Problem. 100-109 - Hans S. Witsenhausen:
Team Guessing with Lacunary Information. 110-121 - Philip C. Jones:
Analysis of a Dynamic Duopoly Model of Advertising. 122-134 - Jean-Louis Goffin:
Convergence Rates of the Ellipsoid Method on General Convex Functions. 135-150 - D. P. Kennedy:
Stimulating Prices in a Stochastic Model of Resource Allocation. 151-157
Volume 8, Number 2, May 1983
- Ramón V. León, James Lynch:
Preservation of Life Distribution Classes Under Reliability Operations. 159-169 - Hermann Buer, Rolf H. Möhring:
A Fast Algorithm for the Decomposition of Graphs and Posets. 170-184 - Robert Mifflin:
A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions. 185-195 - Willard I. Zangwill:
Nonconvexities in Univalence. 196-204 - Chal Sussangkarn:
A Unique Bargaining Solution Based on Competitive Commitments. 205-214 - J. B. Rosen:
Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain. 215-230 - Jean-Philippe Vial:
Strong and Weak Convexity of Sets and Functions. 231-259 - Jonathan F. Bard:
An Algorithm for Solving the General Bilevel Programming Problem. 260-272 - Faiz A. Al-Khayyal, James E. Falk:
Jointly Constrained Biconvex Programming. 273-286 - William D. Sudderth:
Gambling Problems with a Limit Inferior Payoff. 287-297 - Awi Federgruen, Paul J. Schweitzer, Henk C. Tijms:
Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards. 298-313 - R. K. Ahuja, J. L. Batra, S. K. Gupta:
Combinatorial Optimization with Rational Objective Functions: A Communication. 314 - Liqun Qi:
Complete Closedness of Maximal Monotone Operators. 315-317
Volume 8, Number 3, August 1983
- William Thomson
:
The Fair Division of a Fixed Supply Among a Growing Population. 319-326 - Robert J. Aumann, Y. Katznelson, Roy Radner, Robert W. Rosenthal, B. Weiss:
Approximate Purification of Mixed Strategies. 327-341 - Eric V. Denardo, Uriel G. Rothblum:
Affine Structure and Invariant Policies for Dynamic Programs. 342-365 - Manfred Schäl:
Stationary Policies in Dynamic Programming Models Under Compactness Assumptions. 366-372 - J. M. McNamara:
Optimal Control of the Diffusion Coefficient of a Simple Diffusion Process. 373-380 - Martin E. Dyer:
The Complexity of Vertex Enumeration Methods. 381-402 - Jonathan M. Borwein:
Adjoint Process Duality. 403-434 - Wagner De Souza Borges, Flávio Wagner Rodrigues:
An Axiomatic Characterization of Multistate Coherent Structures. 435-438 - J. Michael Harrison, Michael I. Taksar:
Instantaneous Control of Brownian Motion. 439-453 - J. Michael Harrison, Thomas M. Sellke, Allison James Taylor:
Impulse Control of Brownian Motion. 454-466 - Eng Ung Choo, Derek R. Atkins:
Proper Efficiency in Nonconvex Multicriteria Programming. 467-470 - Douglas H. Blair, Robert A. Pollak:
Polychromatic Acyclic Tours in Colored Multigraphs. 471-476 - Alan M. Frieze:
Corrigendum: Algebraic Linear Programming. 477 - Edward J. Anderson, P. Nash, Andrew B. Philpott:
Erratum. 478
Volume 8, Number 4, November 1983
- Joseph J. M. Evers:
A Duality Theory for Infinite-Horizon Optimization of Concave Input/Ouput Processes. 479-497 - Nimrod Megiddo:
The Weighted Euclidean 1-Center Problem. 498-504 - Gordon B. Hazen:
Preference Convex Unanimity in Multiple Criteria Decision Making. 505-516 - Masao Fukushima:
A Fixed Point Approach to Certain Convex Programs with Applications in Stochastic Programming. 517-524 - M. A. H. Dempster, Marshall L. Fisher, L. Jansen, B. J. Lageweg, Jan Karel Lenstra, A. H. G. Rinnooy Kan:
Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems. 525-537 - Hendrik W. Lenstra Jr.:
Integer Programming with a Fixed Number of Variables. 538-548 - Richard D. McKelvey:
Constructing Majority Paths Between Arbitrary Points: General Methods of Solution for Quasi-Concave Preferences. 549-556 - Romesh Saigal:
A Homotopy for Solving Large, Sparse and Structured Fixed Point Problems. 557-578 - D. Chinhyung Cho, Ellis L. Johnson, Manfred Padberg, M. R. Rao:
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets. 579-589 - D. Chinhyung Cho, Manfred W. Padberg, M. R. Rao:
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems. 590-612 - John P. Lehoczky, Suresh P. Sethi, Steven E. Shreve:
Optimal Consumption and Investment Policies Allowing Consumption Constraints and Bankruptcy. 613-636
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-01-08 22:42 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:
