An Offensive Earned-Run Average for Baseball

Pages:729–740

Published Online:October 1, 1977

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

Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems

Pages:741–751

Published Online:October 1, 1977

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

A General Algorithm for One-Dimensional Knapsack Problems

Pages:752–759

Published Online:October 1, 1977

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

The Set-Covering Problem: A New Implicit Enumeration Algorithm

Pages:760–772

Published Online:October 1, 1977

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

An Algorithm for the Vertex Packing Problem

Pages:773–787

Published Online:October 1, 1977

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

A Simplex-Like Algorithm for the Continuous Modular Design Problem

Pages:788–807

Published Online:October 1, 1977

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

An Algorithm for Some Special Nondifferentiable Optimization Problems

Pages:808–817

Published Online:October 1, 1977

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

On Optimal Dividend, Reinvestment, and Liquidation Policies for the Firm

Pages:818–834

Published Online:October 1, 1977

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

The (S − 1, S) Inventory Model under Time Limit on Backorders

Pages:835–850

Published Online:October 1, 1977

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

Bounds and Approximations in Queuing through Monotonicity and Continuity

Pages:851–863

Published Online:October 1, 1977

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

Optimal Search of a Moving Target

Pages:864–870

Published Online:October 1, 1977

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

Free Access
Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges

Pages:871–874

Published Online:October 1, 1977

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

Free Access
Technical Note—An Importance Ranking for System Components Based upon Cuts

Pages:874–879

Published Online:October 1, 1977

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

Free Access
Technical Note—An Inequality for the Variance of Waiting Time under a General Queuing Discipline

Pages:879–884

Published Online:October 1, 1977

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

Free Access
Technical Note—Optimal Strategy for the One-against-Many Battle

Pages:884–888

Published Online:October 1, 1977

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

Free Access
Technical Note—Bayesian Decision Making with Ordinal Information

Pages:889–892

Published Online:October 1, 1977

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

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.