Donald M. Simmons

Common-Stock Transaction Sequences and the Random-Walk Model
OPERATIONS RESEARCH 1971 19: 845-861. [Abstract] [PDF]  

R. Longworth Smith

Accommodating Student Demand for Courses by Varying the Classroom-Size Mix
OPERATIONS RESEARCH 1971 19: 862-874. [Abstract] [PDF]  

Ralph L. Keeney

Utility Independence and Preferences for Multiattributed Consequences
OPERATIONS RESEARCH 1971 19: 875-893. [Abstract] [PDF]  

Joseph B. Kadane

Optimal Whereabouts Search
OPERATIONS RESEARCH 1971 19: 894-904. [Abstract] [PDF]  

P. J. Doulliez and M. R. Rao

Capacity of a Network with Increasing Demands and Arcs Subject to Failure
OPERATIONS RESEARCH 1971 19: 905-915. [Abstract] [PDF]  

Paul A. Jensen

Optimum Network Partitioning
OPERATIONS RESEARCH 1971 19: 916-932. [Abstract] [PDF]  

Alan I. Penn

A Generalized Lagrange-Multiplier Method for Constrained Matrix Games
OPERATIONS RESEARCH 1971 19: 933-945. [Abstract] [PDF]  

L. S. Lasdon and R. C. Terjung

An Efficient Algorithm for Multi-Item Scheduling
OPERATIONS RESEARCH 1971 19: 946-969. [Abstract] [PDF]  

Gerald G. Brown and Herbert C. Rutemiller

A Sequential Stopping Rule for Fixed-Sample Acceptance Tests
OPERATIONS RESEARCH 1971 19: 970-976. [Abstract] [PDF]  

Henri Theil

Technical Note—The Allocation of Power that Minimizes Tension
OPERATIONS RESEARCH 1971 19: 977-982. [Abstract] [PDF]  

Jin Y. Yen

Technical Note—On Hu's Decomposition Algorithm for Shortest Paths in a Network
OPERATIONS RESEARCH 1971 19: 983-985. [Abstract] [PDF]  

Richard M. Simon and D. A. D'Esopo

Technical Note—Comments on a Paper by S. G. Allen and D. A. D'Esopo: "An Ordering Policy for Repairable Stock Items"
OPERATIONS RESEARCH 1971 19: 986-988. [Abstract] [PDF]  

S. J. Deitchman

Letter to the Editor—Implementation of New Ideas in Bureaucracies
OPERATIONS RESEARCH 1971 19: 989-990. [Abstract] [PDF]  

T. A. Ewashko and R. C. Dudding

Letter to the Editor—Application of Kuhn's Hungarian Assignment Algorithm to Posting Servicemen
OPERATIONS RESEARCH 1971 19: 991. [Abstract] [PDF]  

Walter R. Crowe

Letter to the Editor—The Language of Lot Size
OPERATIONS RESEARCH 1971 19: 992-997. [Abstract] [PDF]  

C. E. Lemke, H. M. Salkin, and K. Spielberg

Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
OPERATIONS RESEARCH 1971 19: 998-1022. [Abstract] [PDF]  

Fred Glover

A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg
OPERATIONS RESEARCH 1971 19: 1023-1025. [Abstract] [PDF]  

F. J. Gould

Nonlinear Pricing: Applications to Concave Programming
OPERATIONS RESEARCH 1971 19: 1026-1035. [Abstract] [PDF]  

Ronald E. Davis, David A. Kendrick, and Martin Weitzman

A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming Problems
OPERATIONS RESEARCH 1971 19: 1036-1044. [Abstract] [PDF]  

Hamdy A. Taha and Guy L. Curry

Classical Derivation of the Necessary and Sufficient Conditions for Optimal Linear Programs
OPERATIONS RESEARCH 1971 19: 1045-1050. [Abstract] [PDF]  

G. L. Nemhauser and W. B. Widhelm

A Modified Linear Program for Columnar Methods in Mathematical Programming
OPERATIONS RESEARCH 1971 19: 1051-1060. [Abstract] [PDF]  

R. G. Jeroslow

Comments on Integer Hulls of Two Linear Constraints
OPERATIONS RESEARCH 1971 19: 1061-1069. [Abstract] [PDF]  

J. A. Tomlin

Technical Note—An Improved Branch-and-Bound Method for Integer Programming
OPERATIONS RESEARCH 1971 19: 1070-1075. [Abstract] [PDF]  

B. D. Craven and B. Mond

Technical Note—On Converse Duality in Nonlinear Programming
OPERATIONS RESEARCH 1971 19: 1075-1078. [Abstract] [PDF]  

J. P. Evans, F. J. Gould, and S. M. Howe

Technical Note—A Note on Extended GLM
OPERATIONS RESEARCH 1971 19: 1079-1080. [Abstract] [PDF]  

Thomas E. Morton

Technical Note—Undiscounted Markov Renewal Programming Via Modified Successive Approximations
OPERATIONS RESEARCH 1971 19: 1081-1089. [Abstract] [PDF]  

C. R. Baugh, T. Ibaraki, and S. Muroga

Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks
OPERATIONS RESEARCH 1971 19: 1090-1096. [Abstract] [PDF]  

M. S. Bazaraa, J. J. Goode, and C. M. Shetty

Technical Note—A Unified Nonlinear Duality Formulation
OPERATIONS RESEARCH 1971 19: 1097-1100. [Abstract] [PDF]  

David G. Luenberger

Technical Note—Cyclic Dynamic Programming: A Procedure for Problems with Fixed Delay
OPERATIONS RESEARCH 1971 19: 1101-1110. [Abstract] [PDF]  

The Analyst's Bookshelf
OPERATIONS RESEARCH 1971 19: 1111-1116. [Abstract] [PDF]  

Books Received
OPERATIONS RESEARCH 1971 19: 1116-1117. [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.