Research Article

A Structure Theory for the Parametric Submodular Intersection Problem

Pages:513–521

Published Online:July 22, 2009

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

Stochastic Combinatorial Optimization with Controllable Risk Aversion Level

Pages:522–537

Published Online:August 6, 2009

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

Minimal Valid Inequalities for Integer Constraints

Pages:538–546

Published Online:July 22, 2009

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

Tail Decay Rates in Double QBD Processes and Related Reflected Random Walks

Pages:547–575

Published Online:July 22, 2009

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

Asymptotic Convergence of Optimal Policies for Resource Management with Application to Harvesting of Multiple Species Forest

Pages:576–593

Published Online:August 6, 2009

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

Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems

Pages:594–620

Published Online:August 1, 2009

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

An Efficient Rescaled Perceptron Algorithm for Conic Systems

Pages:621–641

Published Online:August 1, 2009

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

Importance Sampling for Weighted-Serve-the-Longest-Queue

Pages:642–660

Published Online:August 6, 2009

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

Time Continuity and Nonadditive Expected Utility

Pages:661–673

Published Online:August 11, 2009

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

A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

Pages:674–685

Published Online:August 6, 2009

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

Extended Formulations for Packing and Partitioning Orbitopes

Pages:686–697

Published Online:July 22, 2009

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

Integer Knapsacks: Average Behavior of the Frobenius Numbers

Pages:698–705

Published Online:August 6, 2009

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

Random Order Congestion Games

Pages:706–725

Published Online:August 1, 2009

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

Online Markov Decision Processes

Pages:726–736

Published Online:July 22, 2009

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

Markov Decision Processes with Arbitrary Reward Processes

Pages:737–757

Published Online:August 6, 2009

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

Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem

Pages:758–768

Published Online:August 6, 2009

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

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.