Robert G. Bland, Donald Goldfarb, and Michael J. Todd

Feature Article—The Ellipsoid Method: A Survey
OPERATIONS RESEARCH 1981 29: 1039-1091. [Abstract] [PDF]  

Harald Dyckhoff

A New Linear Programming Approach to the Cutting Stock Problem
OPERATIONS RESEARCH 1981 29: 1092-1104. [Abstract] [PDF]  

Ralph L. Keeney

Analysis of Preference Dependencies among Objectives
OPERATIONS RESEARCH 1981 29: 1105-1120. [Abstract] [PDF]  

William F. Massy, Richard C. Grinold, David S. P. Hopkins, and Alejandro Gerson

Optimal Smoothing Rules for University Financial Planning
OPERATIONS RESEARCH 1981 29: 1121-1136. [Abstract] [PDF]  

Michael H. Wagner

Supply-Demand Decomposition of the National Coal Model
OPERATIONS RESEARCH 1981 29: 1137-1153. [Abstract] [PDF]  

Lawrence D. Stone and Joseph B. Kadane

Optimal Whereabouts Search for a Moving Target
OPERATIONS RESEARCH 1981 29: 1154-1166. [Abstract] [PDF]  

J. S. Kaufman

Congestion Formulas for a Heterogeneous Server Loss System with Random Selection Discipline
OPERATIONS RESEARCH 1981 29: 1167-1180. [Abstract] [PDF]  

D. G. Nguyen and D. N. P. Murthy

Optimal Preventive Maintenance Policies for Repairable Systems
OPERATIONS RESEARCH 1981 29: 1181-1194. [Abstract] [PDF]  

R. N. Burns and G. Steiner

Single Machine Scheduling with Series-Parallel Precedence Constraints
OPERATIONS RESEARCH 1981 29: 1195-1207. [Abstract] [PDF]  

W. K. Grassmann

Technical Note—The Optimal Estimation of the Expected Number in a M/D/ Queueing System
OPERATIONS RESEARCH 1981 29: 1208-1211. [Abstract] [PDF]  

Howard J. Weiss

Technical Note—Further Results on an Infinite Capacity Shuttle with Control at a Single Terminal
OPERATIONS RESEARCH 1981 29: 1212-1217. [Abstract] [PDF]  

Zvi Drezner

Technical Note—On Location Dominance on Spherical Surfaces
OPERATIONS RESEARCH 1981 29: 1218-1219. [Abstract] [PDF]  

Henrik Juel

Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
OPERATIONS RESEARCH 1981 29: 1219-1227. [Abstract] [PDF]  

Alan R. Washburn

Technical Note—An Upper Bound Useful in Optimizing Search for a Moving Target
OPERATIONS RESEARCH 1981 29: 1227-1230. [Abstract] [PDF]  

Diego R. Roque

Technical Note—A Note on the M/M/1 Queue with = µ
OPERATIONS RESEARCH 1981 29: 1231-1234. [Abstract] [PDF]  

Moshe Sniedovich

Technical Note—Analysis of a Preference Order Traveling Salesman Problem
OPERATIONS RESEARCH 1981 29: 1234-1237. [Abstract] [PDF]  

Edward P. C. Kao

Errata
OPERATIONS RESEARCH 1981 29: 1238. [Abstract] [PDF]  

The 1981 Lanchester Prize Call for Nominations
OPERATIONS RESEARCH 1981 29: 1239-1240. [Abstract] [PDF]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.