Free Access
In This Issue

Pages:2–4

Published Online:February 1, 1991

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

OR Forum

Free Access
Knowledge and Economic Development

Pages:5–8

Published Online:February 1, 1991

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

Research Article

Equilibrium Modeling, Analysis and Computation: The Contributions of Stella Dafermos

Pages:9–12

Published Online:February 1, 1991

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

OR Practice

Free Access
Natural Resource Land Management Planning Using Large-Scale Linear Programs: The USDA Forest Service Experience with FORPLAN

Pages:13–27

Published Online:February 1, 1991

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

Research Article

Development and Use of a Modeling System to Aid a Major Oil Company in Allocating Bidding Capital

Pages:28–41

Published Online:February 1, 1991

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

The Line Segmentation Problem

Pages:42–55

Published Online:February 1, 1991

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

Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem

Pages:56–63

Published Online:February 1, 1991

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

Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights

Pages:64–81

Published Online:February 1, 1991

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

Optimal Pacing of Trains in Freight Railroads: Model Formulation and Solution

Pages:82–99

Published Online:February 1, 1991

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

Finite Dominating Sets for Network Location Problems

Pages:100–118

Published Online:February 1, 1991

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

On the Existence of a Feasible Flow in a Stochastic Transportation Network

Pages:119–129

Published Online:February 1, 1991

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

Structured Partitioning Problems

Pages:130–149

Published Online:February 1, 1991

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

An Algorithm for the Three-Index Assignment Problem

Pages:150–161

Published Online:February 1, 1991

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

Computationally Feasible Bounds for Partially Observed Markov Decision Processes

Pages:162–175

Published Online:February 1, 1991

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

Free Access
Contributors

Pages:176–177

Published Online:February 1, 1991

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

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.