Research Article

Simultaneous Ad Auctions

Pages:1–13

Published Online:February 2, 2011

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

Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling

Pages:14–23

Published Online:February 2, 2011

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

A Geometric Characterization of the Power of Finite Adaptability in Multistage Stochastic and Adaptive Optimization

Pages:24–54

Published Online:February 1, 2011

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

Generic Optimality Conditions for Semialgebraic Convex Programs

Pages:55–70

Published Online:February 1, 2011

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

Buy-at-Bulk Network Design with Protection

Pages:71–87

Published Online:February 1, 2011

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

On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming

Pages:88–104

Published Online:February 2, 2011

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

Discounted Continuous-Time Markov Decision Processes with Constraints: Unbounded Transition and Loss Rates

Pages:105–132

Published Online:February 2, 2011

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

Discounted Approximations for Risk-Sensitive Average Criteria in Markov Decision Chains with Finite State Space

Pages:133–146

Published Online:February 2, 2011

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

Average Optimality in Nonhomogeneous Infinite Horizon Markov Decision Processes

Pages:147–164

Published Online:February 2, 2011

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

Necessary Optimality Conditions for Multiobjective Bilevel Programs

Pages:165–184

Published Online:February 1, 2011

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

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.