Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

Free Access
Feature Article—Aggregate Advertising Models: The State of the Art

Pages:629–667

Published Online:August 1, 1979

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

Preview Abstract
Markov Models of Advertising and Pricing Decisions

Pages:668–681

Published Online:August 1, 1979

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

Preview Abstract
Optimizing Advertising Expenditures in a Dynamic Duopoly

Pages:682–692

Published Online:August 1, 1979

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

Preview Abstract
A Queueing Theory, Bayesian Model for the Circulation of Books in a Library

Pages:693–716

Published Online:August 1, 1979

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

Preview Abstract
On the Stationary Analysis of Continuous Review (s, S) Inventory Systems with Constant Lead Times

Pages:717–729

Published Online:August 1, 1979

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

Preview Abstract
Infinite-Horizon Dynamic Programming Models—A Planning-Horizon Formulation

Pages:730–742

Published Online:August 1, 1979

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

Preview Abstract
Bounding Global Minima with Interval Arithmetic

Pages:743–754

Published Online:August 1, 1979

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

Preview Abstract
The Sum of Serial Correlations of Waiting and System Times in GI/G/1 Queues

Pages:755–766

Published Online:August 1, 1979

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

Preview Abstract
Queues Solvable without Rouché's Theorem

Pages:767–781

Published Online:August 1, 1979

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

Preview Abstract
The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations

Pages:782–791

Published Online:August 1, 1979

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

Preview Abstract
The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions

Pages:792–798

Published Online:August 1, 1979

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

Preview Abstract
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit

Pages:799–809

Published Online:August 1, 1979

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

Preview Abstract
Measurable Multiattribute Value Functions

Pages:810–822

Published Online:August 1, 1979

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

Preview Abstract
Computing Network Reliability

Pages:823–838

Published Online:August 1, 1979

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

Preview Abstract
Free Access
Technical Note—A Note on the Nerlove-Arrow Model under Uncertainty

Pages:839–842

Published Online:August 1, 1979

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

Preview Abstract
Free Access
Technical Note—Constraint Qualifications for Inexact Linear Programs

Pages:843–847

Published Online:August 1, 1979

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

Preview Abstract
Free Access
Letter to the Editor—Comments on the Possibility of Cycling with the Simplex Method

Pages:848–852

Published Online:August 1, 1979

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

Free Access
Letter to the Editor—To the Editor

Pages:852–852

Published Online:August 1, 1979

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

Preview Abstract
Free Access
Letter to the Editor—To the Editor

Pages:852–854

Published Online:August 1, 1979

https://doi.org/10.1287/opre.27.4.852a

Preview Abstract
Free Access
Errata

Pages:854–854

Published Online:August 1, 1979

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

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