Research Articles

Dynamic Asset Allocation with Uncertain Jump Risks: A Pathwise Optimization Approach

Pages:347–376

Published Online:June 6, 2017

https://doi.org/10.1287/moor.2017.0854

Optimal Dividend Strategies of Two Collaborating Businesses in the Diffusion Approximation Model

Pages:377–398

Published Online:August 23, 2017

https://doi.org/10.1287/moor.2017.0860

Two-Armed Restless Bandits with Imperfect Information: Stochastic Control and Indexability

Pages:399–427

Published Online:September 5, 2017

https://doi.org/10.1287/moor.2017.0863

Opposite Elements in Clutters

Pages:428–459

Published Online:September 18, 2017

https://doi.org/10.1287/moor.2017.0864

Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations

Pages:460–493

Published Online:October 25, 2017

https://doi.org/10.1287/moor.2017.0867

Workload-Dependent Dynamic Priority for the Multiclass Queue with Reneging

Pages:494–515

Published Online:November 7, 2017

https://doi.org/10.1287/moor.2017.0869

Nonzero-Sum Risk-Sensitive Stochastic Games on a Countable State Space

Pages:516–532

Published Online:October 31, 2017

https://doi.org/10.1287/moor.2017.0870

Ideal Clutters That Do Not Pack

Pages:533–553

Published Online:October 31, 2017

https://doi.org/10.1287/moor.2017.0871

Risk-Averse Approximate Dynamic Programming with Quantile-Based Risk Measures

Pages:554–579

Published Online:November 13, 2017

https://doi.org/10.1287/moor.2017.0872

Minimizing Piecewise-Concave Functions Over Polyhedra

Pages:580–597

Published Online:October 2, 2017

https://doi.org/10.1287/moor.2017.0873

Reversibility and Further Properties of FCFS Infinite Bipartite Matching

Pages:598–621

Published Online:December 12, 2017

https://doi.org/10.1287/moor.2017.0874

Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming

Pages:622–637

Published Online:December 15, 2017

https://doi.org/10.1287/moor.2017.0875

A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem

Pages:638–650

Published Online:January 3, 2018

https://doi.org/10.1287/moor.2017.0876

The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem

Pages:651–674

Published Online:October 3, 2017

https://doi.org/10.1287/moor.2017.0877

Robust Randomized Matchings

Pages:675–692

Published Online:December 27, 2017

https://doi.org/10.1287/moor.2017.0878

Editorial Board

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.