Journal: Math. Oper. Res.

Volume 21, Issue 4

769 -- 782Alfred Auslender. Noncoercive Optimization Problems
783 -- 792Harald Günzel. The Crease Structure of the Karush-Kuhn-Tucker Set in Parametric Optimization
815 -- 838Stephen J. Wright, Daniel Ralph. A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
860 -- 885Osman Güler. Barrier Functions in Interior Point Methods
886 -- 904Robert Weismantel. Hilbert Bases and the Facets of Special Knapsack Polytopes
905 -- 921Manoj K. Chari, J. Scott Provan. K-Connectedness Reliability Using Steiner Bounds
922 -- 945Eugene A. Feinberg, Adam Shwartz. Constrained Discounted Dynamic Programming
946 -- 954M. Ali Khan, Yeneng Sun. Integrals of Set-Valued Functions with a Countable Range
955 -- 978Stefan Scholtes. Homeomorphism Conditions for Coherently Oriented Piecewise Affine Mappings
979 -- 990Joël Blot, Naïla Hayek. Second-Order Necessary Conditions for the Infinite-Horizon Variational Problems
991 -- 999Srihari Govindan. A Subgame Property of Stable Equilibria
1000 -- 1015Massimo Marinacci. Decomposition and Representation of Coalitional Games
1016 -- 1022János Flesch, Frank Thuijsman, O. J. Vrieze. Recursive Repeated Games with Absorbing States

Volume 21, Issue 3

513 -- 528Stephen M. Robinson. Analysis of Sample-Path Optimization
529 -- 539Donald Goldfarb, Zhiying Jin. A Faster Combinatorial Algorithm for the Generalized Circulation Problem
540 -- 554Frank K. Hwang, Uriel G. Rothblum. Directional-Quasi-Convexity, Asymmetric Schur-Convexity and Optimality of Consecutive Partitions
555 -- 575Alberto Seeger. Subgradients of Optimal-Value Functions in Dynamic Programming: The Case of Convex Systems Without Optimal Paths
576 -- 588A. S. Lewis. Derivatives of Spectral Functions
589 -- 614Jorge J. Moré. Global Methods for Nonlinear Complementarity Problems
615 -- 628A. Shapiro, Yorai Wardi. Convergence Analysis of Stochastic Algorithms
629 -- 654Renato D. C. Monteiro, Jong-Shi Pang. Properties of an Interior-Point Mapping for Mixed Complementarity Problems
655 -- 674Xun Yu Zhou. Deterministic Near-Optimal Controls. Part II: Dynamic Programming and Viscosity Solution Approach
675 -- 696P. Jean-Jacques Herings, Dolf Talman, Zaifu Yang. The Computation of a Continuum of Constrained Equilibria
697 -- 706Ehud Lehrer, Rann Smorodinsky. Compatible Measures and Merging
707 -- 725Dov Monderer, Dov Samet. Proximity of Information in Games with Incomplete Information
726 -- 733William Stanford. The Limit Distribution of Pure Strategy Nash Equilibria in Symmetric Bimatrix Games
734 -- 756Peter Sudhölter. The Modified Nucleolus as Canonical Representation of Weighted Majority Games
757 -- 768Jos A. M. Potters, Johannes H. Reijnierse, Michel Ansing. Computing the Nucleolus by Solving a Prolonged Simplex Algorithm

Volume 21, Issue 2

257 -- 306Dimitris Bertsimas, José Niño-Mora. Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
307 -- 320Leonid G. Khachiyan. Rounding of Polytopes in the Real Number Model of Computation
321 -- 340Michael D. Grigoriadis, Leonid G. Khachiyan. Coordination Complexity of Parallel Price-Directive Decomposition
341 -- 353B. Jansen, C. Roos, Tamás Terlaky. A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
354 -- 381Levent Tunçel, Michael J. Todd. Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming
382 -- 400Shinji Mizuno. A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
401 -- 426Jong-Shi Pang, Daniel Ralph. Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
427 -- 441R. Sridhar. The Degree of an Exact Order Matrix
442 -- 468Jonathan M. Borwein, Adrian S. Lewis, Dominikus Noll. Maximum Entropy Reconstruction Using Derivative Information, Part 1: Fisher Information and Convex Duality
469 -- 476Ger Koole. On the Pathwise Optimal Bernoulli Routing Policy for Homogeneous Parallel Servers
477 -- 486Olivier Gossner. Overlapping Generation Games with Mixed Strategies
487 -- 512Nahum Shimkin, Adam Shwartz. Asymptotically Efficient Adaptive Strategies in Repeated Games Part II. Asymptotic Optimality

Volume 21, Issue 1

1 -- 25J. Frédéric Bonnans, Clóvis C. Gonzaga. Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
26 -- 43Donald J. Brown, Peter M. Demarzo, B. Curtis Eaves. Computing Zeros of Sections of Vector Bundles Using Homotopies and Relocalization
44 -- 64Menglin Cao, Michael C. Ferris. A Pivotal Method for Affine Variational Inequalities
65 -- 84Alexander I. Barvinok. Two Algorithmic Results for the Traveling Salesman Problem
85 -- 99Benjamin Yakir. The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
100 -- 114J. A. Hoogeveen. Minimizing Maximum Promptness and Maximum Lateness on a Single Machine
115 -- 134J. G. Dai, Gideon Weiss. Stability and Instability of Fluid Models for Reentrant Lines
135 -- 157Dirk P. Kroese, Volker Schmidt. Light-Traffic Analysis for Queues with Spatially Distributed Arrivals
158 -- 181Arie Leizarowitz. Overtaking and Almost-Sure Optimality for Infinite Horizon Markov Decision Processes
182 -- 194Robert B. Lund, Richard L. Tweedie. Geometric Convergence Rates for Stochastically Ordered Markov Chains
195 -- 208Pierre Hansen, Fred S. Roberts. An Impossibility Result in Axiomatic Location Theory
209 -- 236Bernard De Meyer. Repeated Games and Partial Differential Equations
237 -- 251Bernard De Meyer. Repeated Games, Duality and the Central Limit Theorem