Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

In This Issue

Free Access
In This Issue

Pages:iii–vii

Published Online:February 1, 2011

https://doi.org/10.1287/opre.1110.0924

Research Article

OR PRACTICE—Scheduling of Dynamic In-Game Advertising

Pages:1–16

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0852

Preview Abstract
The Price of Fairness

Pages:17–31

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0865

Preview Abstract
Risk Analysis of Collateralized Debt Obligations

Pages:32–49

Published Online:December 30, 2010

https://doi.org/10.1287/opre.1100.0864

Preview Abstract
Routing and Staffing in Large-Scale Service Systems: The Case of Homogeneous Impatient Customers and Heterogeneous Servers

Pages:50–65

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0878

Preview Abstract
On the Minimax Complexity of Pricing in a Changing Environment

Pages:66–79

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0867

Preview Abstract
Quasi-Monte Carlo Methods in Financial Engineering: An Equivalence Principle and Dimension Reduction

Pages:80–95

Published Online:December 7, 2010

https://doi.org/10.1287/opre.1100.0853

Preview Abstract
Kernel Estimation of the Greeks for Options with Discontinuous Payoffs

Pages:96–108

Published Online:December 7, 2010

https://doi.org/10.1287/opre.1100.0844

Preview Abstract
Optimal Inventory Policies when Purchase Price and Demand Are Stochastic

Pages:109–124

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0862

Preview Abstract
Risk-Averse Two-Stage Stochastic Linear Programming: Modeling and Decomposition

Pages:125–132

Published Online:December 7, 2010

https://doi.org/10.1287/opre.1100.0847

Preview Abstract
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem

Pages:133–142

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0851

Preview Abstract
Average Cost Single-Stage Inventory Models: An Analysis Using a Vanishing Discount Approach

Pages:143–155

Published Online:December 7, 2010

https://doi.org/10.1287/opre.1100.0845

Preview Abstract
Supply Chain Competition with Multiple Manufacturers and Retailers

Pages:156–172

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0863

Preview Abstract
Solving Nonlinear Covering Problems Arising in WLAN Design

Pages:173–187

Published Online:February 1, 2011

https://doi.org/10.1287/opre.1100.0897

Preview Abstract
Information Collection on a Graph

Pages:188–201

Published Online:February 1, 2011

https://doi.org/10.1287/opre.1100.0873

Preview Abstract
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs

Pages:202–210

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0882

Preview Abstract
An Integer Optimization Approach to Large-Scale Air Traffic Flow Management

Pages:211–227

Published Online:February 1, 2011

https://doi.org/10.1287/opre.1100.0899

Preview Abstract
An Exact Algorithm for the Period Routing Problem

Pages:228–241

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0875

Preview Abstract
TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards

Pages:242–248

Published Online:December 7, 2010

https://doi.org/10.1287/opre.1100.0857

Preview Abstract
TECHNICAL NOTE—Exact Analysis of a Lost Sales Model Under Stuttering Poisson Demand

Pages:249–253

Published Online:February 8, 2011

https://doi.org/10.1287/opre.1100.0872

Preview Abstract
TECHNICAL NOTE—Robust Newsvendor Competition Under Asymmetric Information

Pages:254–261

Published Online:December 7, 2010

https://doi.org/10.1287/opre.1100.0858

Preview Abstract

Contributors

Free Access
Contributors

Pages:262–266

Published Online:February 1, 2011

https://doi.org/10.1287/opre.1110.0925

Preview Abstract
Previous
Back to Top
Next
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.
Agree