default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 17
Volume 17, Number 1, February 1992
- Paul Glasserman, David D. Yao:
Monotonicity in Generalized Semi-Markov Processes. 1-21 - Leslie A. Hall, David B. Shmoys
:
Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better. 22-35 - Refael Hassin:
Approximation Schemes for the Restricted Shortest Path Problem. 36-42 - Phan Thien Thach:
New Partitioning Method for a Class of Nonconvex Optimization Problems. 43-60 - Yuping Qiu, Thomas L. Magnanti:
Sensitivity Analysis for Variational Inequalities. 61-76 - M. Seetharama Gowda, Jong-Shi Pang:
On Solution Stability of the Linear Complementarity Problem. 77-83 - Søren Asmussen:
Queueing Simulation in Heavy Traffic. 84-111 - Julia L. Higle, Suvrajeet Sen:
On the Convergence of Algorithms with Implications for Stochastic and Nondifferentiable Optimization. 112-131 - Andrew J. Coyle, Peter G. Taylor:
Bounds on the Sensitivity of Generalised Semi-Markov Processes with a Single Generally Distributed Lifetime. 132-147 - Rose-Anne Dana, Monique Pontier:
On the Existence of an Arrow-Radner Equilibrium in the Case of Complete Markets. A Remark. 148-163 - Jos A. M. Potters, Stef Tijs:
The Nucleolus of a Matrix Game and Other Nucleoli. 164-174 - Ehud Lehrer:
Correlated Equilibria in Two-Player Repeated Games with Nonobservable Actions. 175-199 - Ehud Lehrer:
Two-Player Repeated Games with Nonobservable Actions and Observable Payoffs. 200-224 - Renato D. C. Monteiro:
On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming. 225-253
Volume 17, Number 2, May 1992
- Gideon Weiss:
Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling. 255-270 - Rommert Dekker, Arie Hordijk:
Recurrence Conditions for Average and Blackwell Optimality in Denumerable State Markov Decision Chains. 271-289 - Sjur Didrik Flåm:
Solving Convex Programs by Means of Ordinary Differential Equations. 290-302 - Ehud Lehrer, Sylvain Sorin:
A Uniform Tauberian Theorem in Dynamic Programming. 303-307 - Denis Naddef, Giovanni Rinaldi:
The Crown Inequalities for the Symmetric Traveling Salesman Polytope. 308-326 - Imre Bárány:
Fair Distribution Protocols or How the Players Replace Fortune. 327-340 - Jerzy Kyparisis:
Parametric Variational Inequalities with Multivalued Solution Sets. 341-364 - H. Richard Gail, Sidney L. Hantler, B. A. Taylor:
On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes. 365-391 - Eugene A. Feinberg:
On Stationary Strategies in Borel Dynamic Programming. 392-397 - Leslie A. Hall, Thomas L. Magnanti:
A Polyhedral Intersection Theorem for Capacitated Spanning Trees. 398-410 - Ulrich G. Haussmann:
A Probabilistic Approach to the Generalized Hessian. 411-443 - Paul Glasserman, David D. Yao:
Generalized Semi-Markov Processes: Antimatroid Structure and Second-Order Properties. 444-469 - Manfred Schäl:
On the Second Optimality Equation for Semi-Markov Decision Models. 470-486 - Lajos Horváth:
Strong Approximations of Open Queueing Networks. 487-508
Volume 17, Number 3, August 1992
- Andrzej S. Nowak, T. E. S. Raghavan:
Existence of Stationary Correlated Equilibria with Symmetric Information for Discounted Stochastic Games. 519-526 - Takashi Tsuchiya:
Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems. 527-557 - Melike Baykal-Gürsoy, Keith W. Ross:
Variability Sensitive Markov Decision Processes. 558-571 - Erik J. Balder:
Existence Without Explicit Compactness in Stochastic Dynamic Programming. 572-580 - S. Sridhar, R. Chandrasekaran:
Integer Solution to Synthesis of Communication Networks. 581-585 - Shih-Ping Han, Jong-Shi Pang, Narayan Rangaraj:
Globally Convergent Newton Methods for Nonsmooth Equations. 586-607 - David Shallcross:
Neighbors of the Origin for Four by Three Matrices. 608-614 - Zhen Liu, François Baccelli:
Generalized Precedence-Based Queueing Systems. 615-639 - James Bergin:
Player Type Distributions as State Variables and Information Revelation in Zero Sum Repeated Games with Discounting. 640-656 - M. Seetharama Gowda, Jong-Shi Pang:
Some Existence Results for Multivalued Complementarity Problems. 657-669 - Marc Teboulle:
Entropic Proximal Mappings with Applications to Nonlinear Programming. 670-690 - Stephen M. Robinson:
Normal Maps Induced by Linear Transformations. 691-714 - Gerald Beer, Roberto Lucchetti:
The EPI-Distance Topology: Continuity and Stability Results with Applications to Convex Optimization Problems. 715-726 - Scott W. Hadley, Franz Rendl, Henry Wolkowicz:
A New Lower Bound Via Projection for the Quadratic Assignment Problem. 727-739 - Krishna B. Athreya, A. Weerasinghe:
Reflecting Ito Processes in a Stochastic Control Problem. 740-750 - László Lovász, Herbert E. Scarf:
The Generalized Basis Reduction Algorithm. 751-764
Volume 17, Number 4, November 1992
- Daniel Granot, Frieda Granot:
Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem. 765-780 - Nicolas Vieille:
Weak Approachability. 781-791 - Daniel Granot, Frieda Granot:
On Some Network Flow Games. 792-841 - Robin Roundy:
Cyclic Schedules for Job Shops with Identical Jobs. 842-865 - G. Del Grosso, Anna Gerardi, Giorgio Koch:
Optimality in Accelerated Life Tests. 866-881 - Denis Naddef:
The Binested Inequalities for the Symmetric Traveling Salesman Polytope. 882-900 - Robert K. Ritt, Linn I. Sennott:
Optimal Stationary Policies in General State Space Markov Decision Chains with Finite Action Sets. 901-909 - Peter C. Fishburn:
Utility as an Additive Set Function. 910-920 - Ashok P. Maitra, William D. Sudderth:
The Optimal Reward Operator in Negative Dynamic Programming. 921-931 - Suresh P. Sethi, Halil Mete Soner, Qing Zhang, H. Jiang:
Turnpike Sets and Their Analysis in Stochastic Production Planning Problems. 932-950 - Patrick Jaillet:
Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems. 964-980 - Michel Deza, Martin Grötschel, Monique Laurent:
Clique-Web Facets for Multicut Polytopes. 981-1000 - Egon Balas, Matteo Fischetti:
The Fixed-Outdegree 1-Arborescence Polytope. 1001-1018
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 2026-01-20 23:14 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:
