Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

A Model for Predicting Average Fire Engine Travel Times

Pages:603–613

Published Online:August 1, 1975

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

Preview Abstract
Determining the Relation between Fire Engine Travel Times and Travel Distances in New York City

Pages:614–627

Published Online:August 1, 1975

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

Preview Abstract
BRANDAID: A Marketing-Mix Model, Part 1: Structure

Pages:628–655

Published Online:August 1, 1975

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

Preview Abstract
BRANDAID: A Marketing-Mix Model, Part 2: Implementation, Calibration, and Case Study

Pages:656–673

Published Online:August 1, 1975

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

Preview Abstract
Waiting Time in an (S − 1, S) Inventory System

Pages:674–680

Published Online:August 1, 1975

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

Preview Abstract
A Queuing System with Heterogeneous Servers and Autonomous Traffic Control

Pages:681–686

Published Online:August 1, 1975

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

Preview Abstract
Applying a New Device in the Optimization of Exponential Queuing Systems

Pages:687–710

Published Online:August 1, 1975

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

Preview Abstract
Planning Horizons for the Dynamic Lot Size Model: Zabel vs. Protective Procedures and Computational Results

Pages:711–734

Published Online:August 1, 1975

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

Preview Abstract
Optimal Ordering Policies for Perishable Inventory—II

Pages:735–749

Published Online:August 1, 1975

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

Preview Abstract
The Output of an M/D/1 Queue

Pages:750–760

Published Online:August 1, 1975

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

Preview Abstract
Bounds and Transformations for Discounted Finite Markov Decision Chains

Pages:761–784

Published Online:August 1, 1975

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

Preview Abstract
Normalized Markov Decision Chains I; Sensitive Discount Optimality

Pages:785–795

Published Online:August 1, 1975

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

Preview Abstract
Subproblem and Overall Convergence for a Method-of-Centers Algorithm

Pages:796–809

Published Online:August 1, 1975

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

Preview Abstract
Optimal Network Capacity Planning: A Shortest-Path Scheme

Pages:810–818

Published Online:August 1, 1975

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

Preview Abstract
Free Access
Technical Note—Waiting Time in an (S − 1, S) Inventory System—Constant Service Time Case

Pages:819–820

Published Online:August 1, 1975

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

Preview Abstract
Free Access
Technical Note—The Queue M/G/1 When Jobs Are Scheduled within Generations

Pages:821–824

Published Online:August 1, 1975

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

Preview Abstract
Free Access
Technical Note—Stopping Rules for War Games or Combat Simulations with Exponential Life-Times

Pages:824–829

Published Online:August 1, 1975

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

Preview Abstract
Free Access
Technical Note—Delays in Single-Server Queues with Batch Input

Pages:830–833

Published Online:August 1, 1975

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

Preview Abstract
Free Access
Technical Note—A Note on Zero-One Programming

Pages:833–837

Published Online:August 1, 1975

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

Preview Abstract
Free Access
Letter to the Editor—Some Implications of Modeling Food Preferences over Time

Pages:838–839

Published Online:August 1, 1975

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

Free Access
Letter to the Editor—More about Modeling Food Preferences

Pages:839–840

Published Online:August 1, 1975

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

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