Cost-of-Research Index, 1920–1970

Pages:1–18

Published Online:February 1, 1972

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

On Scheduling the Delivery of Babies

Pages:19–23

Published Online:February 1, 1972

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

Single-Server, Two-Machine Sequencing with Switching Time

Pages:24–36

Published Online:February 1, 1972

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

Games of Economic Survival with Discrete- and Continuous-Income Processes

Pages:37–45

Published Online:February 1, 1972

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

Free Access
Technical Note—Some Comments on Engel's “A Verification of Lanchester's Law”

Pages:49–52

Published Online:February 1, 1972

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

Free Access
Technical Note—Asymptotic Properties of Mean Length Estimators for Finite Markov Queues

Pages:52–57

Published Online:February 1, 1972

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

Primal Decomposition of Mathematical Programs by Resource Allocation: I—Basic Theory and a Direction-Finding Procedure

Pages:58–74

Published Online:February 1, 1972

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

Primal Decomposition of Mathematical Programs by Resource Allocation: II—Computational Algorithm with an Application to the Modular Design Problem

Pages:75–93

Published Online:February 1, 1972

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

The Transportation-Location Problem

Pages:94–108

Published Online:February 1, 1972

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

A Noniterative Algorithm for Tridiagonal Transportation Problems and Its Generalization

Pages:109–125

Published Online:February 1, 1972

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

Basic Dual Feasible Solutions for a Class of Generalized Networks

Pages:126–136

Published Online:February 1, 1972

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

On Refinements of Some Duality Theorems in Linear Programming over Cones

Pages:137–142

Published Online:February 1, 1972

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

Extensions of the Evans-Gould Stability Theorems for Mathematical Programs

Pages:143–153

Published Online:February 1, 1972

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

An Algorithm for the Minimum-Risk Problem of Stochastic Programming

Pages:154–164

Published Online:February 1, 1972

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

Free Access
Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming

Pages:165–167

Published Online:February 1, 1972

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

Free Access
Technical Note—Finite Algorithms for Solving Quasiconvex Quadratic Programs

Pages:167–173

Published Online:February 1, 1972

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

Free Access
Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median

Pages:173–178

Published Online:February 1, 1972

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

Free Access
Technical Note—Strengthened Dantzig Cuts for Integer Programming

Pages:178–182

Published Online:February 1, 1972

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

Free Access
Technical Note—A Note on Zero-One Integer and Concave Programming

Pages:182–183

Published Online:February 1, 1972

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

Free Access
The Analyst's Bookshelf

Pages:184–188

Published Online:February 1, 1972

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

Free Access
Reactions to the Guidelines for the Practice of Operations Research

Pages:205–246

Published Online:February 1, 1972

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

Free Access
Announcements

Pages:248–248

Published Online:February 1, 1972

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

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.