David J. Aldous

Cost–Volume Relationship for Flows Through a Disordered Network
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 769-786, published online before print October 17, 2008, DOI: 10.1287/moor.1080.0327. [Abstract] [PDF] [References]  

Srihari Govindan and Robert Wilson

Metastable Equilibria
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 787-820, published online before print November 3, 2008, DOI: 10.1287/moor.1080.0336. [Abstract] [PDF] [References]  

Alexander Vladimirsky

Label-Setting Methods for Multimode Stochastic Shortest Path Problems on Graphs
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 821-838, published online before print October 17, 2008, DOI: 10.1287/moor.1080.0321. [Abstract] [PDF] [References]  

Friedrich Eisenbrand and Gennady Shmonin

Parametric Integer Programming in Fixed Dimension
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 839-850, published online before print October 10, 2008, DOI: 10.1287/moor.1080.0320. [Abstract] [PDF] [References]  

Juliane Dunkel and Andreas S. Schulz

On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 851-868, published online before print October 17, 2008, DOI: 10.1287/moor.1080.0322. [Abstract] [PDF] [References]  

Andriy Zapechelnyuk

Better-Reply Dynamics with Bounded Recall
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 869-879, published online before print October 10, 2008, DOI: 10.1287/moor.1080.0323. [Abstract] [PDF] [References]  

Arnab Basu, Tirthankar Bhattacharyya, and Vivek S. Borkar

A Learning Algorithm for Risk-Sensitive Cost
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 880-898, published online before print October 17, 2008, DOI: 10.1287/moor.1080.0324. [Abstract] [PDF] [References]  

Rami Atar and Adam Shwartz

Efficient Routing in Heavy Traffic Under Partial Sampling of Service Times
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 899-909, published online before print October 17, 2008, DOI: 10.1287/moor.1080.0325. [Abstract] [PDF] [References]  

Anthony Man-Cho So, Yinyu Ye, and Jiawei Zhang

A Unified Theorem on SDP Rank Reduction
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 910-920, published online before print October 17, 2008, DOI: 10.1287/moor.1080.0326. [Abstract] [PDF] [References]  

Geneviève Benoit and Sylvia Boyd

Finding the Exact Integrality Gap for Small Traveling Salesman Problems
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 921-931. [Abstract] [PDF] [References]  

Søren Asmussen, Pierre Fiorini, Lester Lipsky, Tomasz Rolski, and Robert Sheahan

Asymptotic Behavior of Total Times for Jobs That Must Start Over if a Failure Occurs
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 932-944, published online before print November 3, 2008, DOI: 10.1287/moor.1080.0329. [Abstract] [PDF] [References]  

Brian C. Dean, Michel X. Goemans, and Jan Vondrák

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 945-964, published online before print November 3, 2008, DOI: 10.1287/moor.1080.0330. [Abstract] [PDF] [References]  

Wenbao Ai, Yongwei Huang, and Shuzhong Zhang

On the Low Rank Solutions for Linear Matrix Inequalities
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 965-975, published online before print November 3, 2008, DOI: 10.1287/moor.1080.0331. [Abstract] [PDF] [References]  

Zaifu Yang

On the Solutions of Discrete Nonlinear Complementarity and Related Problems
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 976-990, published online before print November 3, 2008, DOI: 10.1287/moor.1080.0343. [Abstract] [PDF] [References]  

Constantin Zalinescu

On Zero Duality Gap and the Farkas Lemma for Conic Programming
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 991-1001. [Abstract] [PDF] [References]  

Bernhard von Stengel and Françoise Forges

Extensive-Form Correlated Equilibrium: Definition and Computational Complexity
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 1002-1022. [Abstract] [PDF] [References]  

Author Index of Volume 33
MATHEMATICS OF OPERATIONS RESEARCH 2008 33: 1023-1024. [Abstract] [PDF]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.