default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 10
Volume 10, Number 1, February 1985
- Joshua Reichert, Yair Tauman:
The Space of Polynomials in Measures is Internal. 1-6 - Nimrod Megiddo, Tetsuo Ichimori:
A Two-Resource Allocation Problem Solvable in Linear Time. 7-16 - Sylvain Sorin, Shmuel Zamir:
A 2-Person Game with Lack of Information on 1½ Sides. 17-23 - N. U. Prabhu, Paul K. Reeser:
A Random Family of Queueing Systems with a Dynamic Priority Discipline. 24-32 - Frank P. Kelly:
Segregating the Input to a Series of Buffers. 33-43 - Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for the Equipollent Resource Allocation Problem. 44-53 - Alfonso Reinoza:
The Strong Positivity Conditions. 54-62 - Michael I. Taksar:
Average Optimal Singular Control and a Related Stopping Problem. 63-81 - Arjang A. Assad:
Nested Optimal Policies for Set Functions with Applications to Scheduling. 82-99 - J. B. G. Frenk, M. van Houweninge, A. H. G. Rinnooy Kan:
Asymptotic Properties of the Quadratic Assignment Problem. 100-116 - Sergiu Hart:
Nonzero-Sum Two-Person Repeated Games with Incomplete Information. 117-153 - John M. Einbu:
Addendum: A Finite Algorithm for Solving Nonlinear Allocation Problems. 154-157 - Amos Altshuler:
The Mani-Walkup Spherical Counterexamples to the Wv-Path Conjecture are Not Polytopal. 158-159 - Arie Hordijk, Frank A. Van der Duyn Schouten:
Markov Decision Drift Processes; Conditions for Optimality Obtained by Discretization. 160-173
Volume 10, Number 2, May 1985
- O. L. Mangasarian:
A Condition Number for Differentiable Convex Inequalities. 175-179 - Dorit S. Hochbaum, David B. Shmoys
:
A Best Possible Heuristic for the k-Center Problem. 180-184 - Krzysztof Czeslaw Kiwiel:
A Linearization Algorithm for Nonsmooth Minimization. 185-194 - Roland Werner, Reinhard Wetzel:
Complementary Pivoting Algorithms Involving Extreme Rays. 195-206 - Alexander Shapiro:
Second-Order Derivatives of Extremal-Value Functions and Optimality Conditions for Semi-Infinite Programs. 207-219 - Karl-Heinz Waldmann:
On Bounds for Dynamic Programs. 220-232 - Norman L. Kleinberg, Jeffrey H. Weiss:
Equivalent N-Person Games and the Null Space of the Shapley Value. 233-243 - Jörgen W. Weibull:
Discounted-Value Representations of Temporal Preferences. 244-250 - William H. Cunningham, András Frank:
A Primal-Dual Algorithm for Submodular Flows. 251-262 - Aharon Ben-Tal:
The Entropic Penalty Approach to Stochastic Programming. 263-279 - Mihalis Yannakakis:
On a Class of Totally Unimodular Matrices. 280-304 - William A. Massey:
Asymptotic Analysis of the Time Dependent M/M/1 Queue. 305-327 - Pedro G. Gazmuri:
Probabilistic Analysis of a Machine Scheduling Problem. 328-339 - Francisco Barahona, Martin Grötschel, Ali Ridha Mahjoub:
Facets of the Bipartite Subgraph Polytope. 340-358 - A. M. H. Gerards:
Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope. 359-360 - Halina Frankowska:
Necessary Conditions for the Bolza Problem. 361-366
Volume 10, Number 3, August 1985
- Robert E. Bixby, William H. Cunningham, Donald M. Topkis:
The Partial Order of a Polymatroid Extreme Point. 367-378 - Alvin E. Roth:
Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions. 379-389 - Abraham Neyman:
Semivalues of Political Economic Games. 390-402 - Herbert E. Scarf:
Integral Polyhedra in Three Space. 403-438 - Philip M. White, Andrew S. Caplin, Ludo van der Heyden:
Scarf's Procedure for Integer Programming and a Dual Simplex Algorithm. 439-449 - Arie Leizarowitz:
Existence of Overtaking Optimal Trajectories for Problems with Convex Integrands. 450-461 - Mordechai I. Henig:
The Principle of Optimality in Dynamic Programming with Returns in Partially Ordered Sets. 462-470 - Frieda Granot, Arthur F. Veinott Jr.:
Substitutes, Complements and Ripples in Network Flows. 471-497 - H. Tuy, T. V. Thieu, Ng Q. Thai:
A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set. 498-514 - Hans-Jakob Lüthi:
On the Solution of Variational Inequalities by the Ellipsoid Method. 515-522 - Joseph Greenberg:
Cores of Convex Games Without Side Payments. 523-525
Volume 10, Number 4, November 1985
- Mordecai Haimovich, Alexander H. G. Rinnooy Kan:
Bounds and Heuristics for Capacitated Routing Problems. 527-542 - Bruce E. Hajek:
Extremal Splittings of Point Processes. 543-556 - Refael Hassin, Eitan Zemel:
On Shortest Paths in Graphs with Random Weights. 557-564 - D. H. Martin, G. G. Watkins:
Cores of Tangent Cones and Clarke's Tangent Cone. 565-575 - Chris N. Potts:
Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates. 576-584 - A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto:
Sequencing Problems in Two-Server Systems. 585-598 - Victor C. Pestien, William D. Sudderth:
Continuous-Time Red and Black: How to Control a Diffusion to a Goal. 599-611 - Okitsugu Fujiwara:
A Note on Differentiability of Global Optimal Values. 612-618 - Paul R. Milgrom, Robert J. Weber:
Distributional Strategies for Games with Incomplete Information. 619-632 - Graciela Chichilnisky:
Von Neumann-Morgenstern Utilities and Cardinal Preferences. 633-641 - Lars Thorlund-Petersen:
Fixed Point Iterations and Global Stability in Economics. 642-649 - Masakazu Kojima, Akira Okada, Susumu Shindoh:
Strongly Stable Equilibrium Points of N-Person Noncooperative Games. 650-663 - Tullio Zolezzi:
Continuity of Generalized Gradients and Multipliers Under Perturbations. 664-673 - Jacob Flachs:
Generalized Cheney-Loeb-Dinkelbach-Type Algorithms. 674-687 - Bruce P. Burrell, Michael J. Todd:
The Ellipsoid Method Generates Dual Variables. 688-700 - James Roskind, Robert E. Tarjan:
A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees. 701-708 - Colin L. Mallows, Vijayan N. Nair, Larry A. Shepp, Yehuda Vardi:
Optimal Sequential Selection of Secretaries. 709-715
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-12-27 21: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:
