default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 15
Volume 15, Number 1, February 1990
- Peter W. Glynn, Donald L. Iglehart:
Simulation Output Analysis Using Standardized Time Series. 1-16 - Kevin D. Glazebrook, N. A. Fay:
Evaluating Strategies for Markov Decision Processes in Parallel. 17-32 - Paul Tseng:
Distributed Computation for Linear Programming Problems Satisfying a Certain Diagonal Dominance Condition. 33-48 - Emmanuel Nicholas Barron, Robert Jensen:
A Stochastic Control Approach to the Pricing of Options. 49-79 - Ioannis Karatzas, John P. Lehoczky, Steven E. Shreve
:
Existence and Uniqueness of Multi-Agent Equilibrium in a Stochastic, Dynamic Consumption/Investment Model. 80-128 - David Assaf, Moshe Haviv:
Reneging from Processor Sharing Systems and Random Queues. 129-138 - Jon Lee:
Characterizations of the Dimension for Classes of Concordant Polytopes. 139-154 - Adam Shwartz, Armand M. Makowski:
Comparing Policies in Markov Decision Processes: Mandl's Lemma Revisited. 155-174 - Karl Sigman:
One-Dependent Regenerative Processes and Queues in Continuous Time. 175-189
Volume 15, Number 2, May 1990
- Renato D. C. Monteiro, Ilan Adler, Mauricio G. C. Resende:
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension. 191-214 - Lawrence M. Wein:
Optimal Control of a Two-Station Brownian Network. 215-242 - N. Eagambaram, S. R. Mohan:
On Some Classes of Linear Complementarity Problems with Matrices of Order n and Rank (n - 1). 243-257 - Yves Crama, Peter L. Hammer, Toshihide Ibaraki:
Packing, Covering and Partitioning Problems with Strongly Unimodular Constraint Matrices. 258-267 - Shoshana Anily, Awi Federgruen:
A Class of Euclidean Routing Problems with General Route Cost Functions. 268-285 - Jerzy Kyparisis:
Sensitivity Analysis for Nonlinear Programs and Variational Inequalities with Nonunique Multipliers. 286-298 - Matthew J. Sobel:
Higher-Order and Average Reward Myopic-Affine Dynamic Models. 299-310 - Jong-Shi Pang:
Newton's Method for B-Differentiable Equations. 311-341 - Sanjay Mehrotra, Jie Sun:
An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations. 342-363 - Ravi Kannan, László Lovász, Herbert E. Scarf:
The Shapes of Polyhedra. 364-380
Volume 15, Number 3, August 1990
- Georg Ch. Pflug:
On-Line Optimization of Simulated Markovian Processes. 381-395 - Julia L. Higle, James C. Bean, Robert L. Smith:
Deterministic Equivalence in Stochastic Infinite Horizon Problems. 396-407 - Renato D. C. Monteiro, Ilan Adler:
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence. 408-422 - Walter D. Morris Jr.:
On the Maximum Degree of an LCP Map. 423-429 - Andrew V. Goldberg, Robert E. Tarjan:
Finding Minimum-Cost Circulations by Successive Approximation. 430-466 - Jianzhong Du, Joseph Y.-T. Leung:
Minimizing Total Tardiness on One Machine is NP-Hard. 483-495 - Chi-Fu Huang, Lode Li:
Continuous Time Stopping Games with Monotone Reward Structures. 496-507 - Michael J. Todd, Yinyu Ye:
A Centered Projective Algorithm for Linear Programming. 508-529 - Dan Bienstock, Odile Marcotte:
On a Network Design Problem That Is Intractable on Trees. 530-544 - Moshe Shaked, J. George Shanthikumar:
Multivariate Stochastic Orderings and Positive Dependence in Reliability Theory. 545-552 - Ron Holzman:
An Axiomatic Approach to Location on Networks. 553-563 - Yinyu Ye:
Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming. 564-572
Volume 15, Number 4, November 1990
- John M. Danskin:
On the Cookie-Cutter Game: Search and Evasion on a Disc. 573-596 - Jean-Paul Penot, Michel Volle:
On Quasi-Convex Duality. 597-625 - Jirí V. Outrata:
On Generalized Gradients in Optimization Problems with Set-Valued Constraints. 626-639 - Andrew B. Philpott:
Continuous-Time Flows in Networks. 640-661 - Masakazu Kojima, Shinji Mizuno, Toshihito Noma:
Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems. 662-675 - M. H. A. Davis, A. R. Norman:
Portfolio Selection with Transaction Costs. 676-713 - Dov Monderer:
A Milnor Condition for Nonatomic Lipschitz Games and Its Applications. 714-723 - Dave Furth:
Solving Bargaining Games by Differential Equations. 724-735 - Clyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei:
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions. 736-748 - J. Michael Steele:
Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space. 749-770 - Frank P. Kelly:
Routing and Capacity Allocation in Networks with Trunk Reservation. 771-793
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-11 20:33 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:
