default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematics of Operations Research, Volume 27
Volume 27, Number 1, February 2002
- Hervé Moulin, Richard Stong:
Fair Queuing and Other Probabilistic Allocation Methods. 1-30 - Xavier Spinat:
A Necessary and Sufficient Condition for Approachability. 31-44 - Donald G. Saari:
Adopting a Plurality Vote Perspective. 45-64 - Itzhak Gilboa, David Schmeidler:
Cognitive Foundations of Probability. 65-81 - Edward J. Anderson
, Andrew B. Philpott:
Optimal Offer Construction in Electricity Markets. 82-100 - Andrew E. B. Lim, Xun Yu Zhou:
Mean-Variance Portfolio Selection with Random Parameters in a Complete Market. 101-120 - Stéphane Villeneuve, Antonino Zanette:
Parabolic ADI Methods for Pricing America Options on Two Stocks. 121-149 - Defeng Sun, Jie Sun:
Semismooth Matrix-Valued Functions. 150-169 - Teemu Pennanen:
Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity. 170-191 - Vivek S. Borkar, Sean P. Meyn:
Risk-Sensitive Optimal Control for Markov Decision Processes with Monotone Cost. 192-209 - Ismael R. de Farias Jr., Ellis L. Johnson, George L. Nemhauser:
Facets of the Complementarity Knapsack Polytope. 210-226 - Peter C. Fishburn, Aleksandar Pekec, James A. Reeds:
Subset Comparisons for Additive Linear Orders. 227-243 - Wansoo T. Rhee:
Packing Random Rectangles of Given Volume. 244-252
Volume 27, Number 2, May 2002
- Shane G. Henderson, Peter W. Glynn:
Approximating Martingales for Variance Reduction in Markov Process Simulation. 253-271 - David Gamarnik:
On Deciding Stability of Constrained Homogeneous Random Walks and Queueing Systems. 272-293 - Vivek S. Borkar:
Q-Learning for Risk-Sensitive Control. 294-311 - Eugene Khmelnitsky:
A Combinatorial, Graph-Based Solution Method for a Class of Continuous-Time Optimal Control Problems. 312-325 - T. Parthasarathy, D. Sampangi Raman, B. Sriparna:
Relationship Between Strong Monotonicity Property, P2-Property, and the Gus-Property in Semidefinite Linear Complementarity Problems. 326-331 - Jie Sun, Kim-Chuan Toh, Gongyun Zhao:
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems. 332-346 - Jean B. Lasserre:
Semidefinite Programming vs. LP Relaxations for Polynomial Programming. 347-360 - Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
A Min-Max Theorem on Feedback Vertex Sets. 361-371 - András Frank, F. Bruce Shepherd, Vivek Tandon, Zoltán Végh:
Node-Capacitated Ring Routing. 372-383 - T. E. S. Raghavan, Zamir Syed:
Computing Stationary Nash Equilibria of Undiscounted Single-Controller Stochastic Games. 384-400 - Emanuel Milman:
The Semi-Algebraic Theory of Stochastic Games. 401-418 - Peter Sudhölter, Bezalel Peleg:
A Note on an Axiomatization of the Core of Market Games. 401-418
Volume 27, Number 3, August 2002
- Kevin D. Wayne:
A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow. 445-459 - Néstor E. Aguilera, Mariana S. Escalante, Graciela L. Nasini:
A Generalization of the Perfect Graph Theorem Under the Disjunctive Index. 460-469 - Quentin Louveaux, Laurence A. Wolsey:
Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs. 470-484 - Mourad Baïou, Michel Balinski:
The Stable Allocation (or Ordinal Transportation) Problem. 485-503 - George M. Adelson-Velsky, Eugene Levner:
Project Scheduling in AND-OR Graphs: A Generalization of Dijkstra's Algorithm. 504-517 - Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber:
Minimizing Service and Operation Costs of Periodic Scheduling. 518-544 - Dmitry Krass, O. J. Vrieze:
Achieving Target State-Action Frequencies in Multichain Average-Reward Markov Decision Processes. 545-566 - James V. Burke, Adrian S. Lewis, Michael L. Overton:
Approximating Subdifferentials by Random Sampling of Gradients. 567-584 - Stephen J. Wright, Dominique Orban:
Properties of the Log-Barrier Function on Degenerate Nonlinear Programs. 585-613 - Alexey F. Izmailov, Mikhail V. Solodov:
The Theory of 2-Regularity for Mappings with Lipschitzian Deriatives and its Applications to Optimality Conditions. 614-635
Volume 27, Number 4, November 2002
- P. Jean-Jacques Herings, Felix Kubler:
Computing Equilibria in Finance Economies. 637-646 - Daniel Granot, Jeroen Kuipers, Sunil Chopra:
Cost Allocation for a Tree Network with Heterogeneous Customers. 647-661 - Mourad Baïou, Michel Balinski:
Erratum: The Stable Allocation (or Ordinal Transportation) Problem. 662-680 - Andreas S. Schulz, Robert Weismantel:
The Complexity of Generic Primal Algorithms for Solving General Integer Programs. 681-692 - Bertrand Guenin:
Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids. 693-710 - Diego Klabjan, George L. Nemhauser:
A Polyhedral Study of Integer Variable Upper Bounds. 711-739 - Michael Malmros Sørensen:
A Note on Clique-Web Facets for Multicut Polytopes. 740-742 - Hiroshige Dan, Nobuo Yamashita, Masao Fukushima:
A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions. 743-753 - María J. Cánovas, Marco A. López, Juan Parra:
Stability in the Discretization of a Parametric Semi-Infinite Convex Inequality System. 755-774 - Alex M. Rubinov, Xuexiang Huang, Xiaoqi Yang:
The Zero Duality Gap Property and Lower Semicontinuity of the Perturbation Function. 775-791 - Svetlozar T. Rachev, Werner Römisch:
Quantitative Stability in Stochastic Programming: The Method of Probability Metrics. 792-818 - Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein:
The Complexity of Decentralized Control of Markov Decision Processes. 819-840
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-11-07 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:
