Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

OR Practice

Free Access
Optimal Commonality in Component Design

Pages:1–19

Published Online:February 1, 2000

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

Preview Abstract

OR Chronicle

Free Access
Decision Making Under Uncertainty: Is Sensitivity Analysis of Any Use?

Pages:20–25

Published Online:February 1, 2000

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

Preview Abstract

Research Article

Stability of Multiclass Queueing Networks Under Priority Service Disciplines

Pages:26–37

Published Online:February 1, 2000

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

Preview Abstract
On a Queueing Network Model for Cellular Mobile Telecommunications Networks

Pages:38–49

Published Online:February 1, 2000

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

Preview Abstract
Management of Multi-Item Retail Inventory Systems with Demand Substitution

Pages:50–64

Published Online:February 1, 2000

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

Preview Abstract
Optimizing Over the Efficient Set Using a Top-Down Search of Faces

Pages:65–72

Published Online:February 1, 2000

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

Preview Abstract
Shape – A Stochastic Hybrid Approximation Procedure for Two-Stage Stochastic Programs

Pages:73–79

Published Online:February 1, 2000

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

Preview Abstract
Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic

Pages:80–90

Published Online:February 1, 2000

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

Preview Abstract
Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs

Pages:91–98

Published Online:February 1, 2000

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

Preview Abstract
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Pages:99–110

Published Online:February 1, 2000

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

Preview Abstract
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

Pages:111–128

Published Online:February 1, 2000

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

Preview Abstract
A Tabu Search Heuristic for the Capacitated arc Routing Problem

Pages:129–135

Published Online:February 1, 2000

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

Preview Abstract
The Stochastic Economic Lot Scheduling Problem: Heavy Traffic Analysis of Dynamic Cyclic Policies

Pages:136–154

Published Online:February 1, 2000

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

Preview Abstract
Finite Horizon Stochastic Knapsacks with Applications to Yield Management

Pages:155–172

Published Online:February 1, 2000

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

Preview Abstract

Technical Notes

Free Access
Separability in Optimal Allocation

Pages:173–176

Published Online:February 1, 2000

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

Preview Abstract

Research Article

Minimizing Cycle Time in a Blocking Flowshop

Pages:177–180

Published Online:February 1, 2000

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

Preview Abstract
Optimality of Myopic Ordering Policies for Inventory Model with Stochastic Supply

Pages:181–184

Published Online:February 1, 2000

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

Preview Abstract

Erratum

Free Access
Erratum to: Shadow Prices for Measures of Effectiveness, Part I: Linear Model

Pages:185–185

Published Online:February 1, 2000

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

Contributors

Free Access
Contributors

Pages:186–188

Published Online:February 1, 2000

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

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