Free Access
Feature Article—The Ellipsoid Method: A Survey

Pages:1039–1091

Published Online:December 1, 1981

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

A New Linear Programming Approach to the Cutting Stock Problem

Pages:1092–1104

Published Online:December 1, 1981

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

Analysis of Preference Dependencies among Objectives

Pages:1105–1120

Published Online:December 1, 1981

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

Optimal Smoothing Rules for University Financial Planning

Pages:1121–1136

Published Online:December 1, 1981

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

Supply-Demand Decomposition of the National Coal Model

Pages:1137–1153

Published Online:December 1, 1981

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

Optimal Whereabouts Search for a Moving Target

Pages:1154–1166

Published Online:December 1, 1981

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

Congestion Formulas for a Heterogeneous Server Loss System with Random Selection Discipline

Pages:1167–1180

Published Online:December 1, 1981

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

Optimal Preventive Maintenance Policies for Repairable Systems

Pages:1181–1194

Published Online:December 1, 1981

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

Single Machine Scheduling with Series-Parallel Precedence Constraints

Pages:1195–1207

Published Online:December 1, 1981

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

Free Access
Technical Note—The Optimal Estimation of the Expected Number in a M/D/∞ Queueing System

Pages:1208–1211

Published Online:December 1, 1981

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

Free Access
Technical Note—Further Results on an Infinite Capacity Shuttle with Control at a Single Terminal

Pages:1212–1217

Published Online:December 1, 1981

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

Free Access
Technical Note—On Location Dominance on Spherical Surfaces

Pages:1218–1219

Published Online:December 1, 1981

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

Free Access
Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty

Pages:1219–1227

Published Online:December 1, 1981

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

Free Access
Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target

Pages:1227–1230

Published Online:December 1, 1981

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

Free Access
Technical Note—A Note on the M/M/1 Queue with λ = μ

Pages:1231–1234

Published Online:December 1, 1981

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

Free Access
Technical Note—Analysis of a Preference Order Traveling Salesman Problem

Pages:1234–1237

Published Online:December 1, 1981

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

Free Access
Errata

Pages:1238–1238

Published Online:December 1, 1981

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

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.