Free Access
In This Issue

Pages:S2–S4, S177

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.S1.2

Research Article

The Scaling Network Simplex Algorithm

Pages:S5–S13

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S5

Habitat Dispersion in Forest Planning and the Stable Set Problem

Pages:S14–S21

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S14

A New Lower Bound for the Quadratic Assignment Problem

Pages:S22–S27

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S22

When Is the Classroom Assignment Problem Hard?

Pages:S28–S39

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S28

A Multiplier Adjustment Approach for the Set Partitioning Problem

Pages:S40–S47

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S40

Multicommodity Network Flows with Safety Considerations

Pages:S48–S55

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S48

m-Median and m-Center Problems with Mutual Communication: Solvable Special Cases

Pages:S56–S66

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S56

On the Optimal Stochastic Scheduling of Out-Forests

Pages:S67–S75

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S67

Fixed Job Scheduling with Two Types of Processors

Pages:S76–S85

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S76

Bounds on a Trauma Outcome Function via Optimization

Pages:S86–S95

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S86

Approximation Algorithms for Fixed Job Schedule Problems

Pages:S96–S108

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S96

A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems

Pages:S109–S116

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S109

A Tie-Breaking Rule for Discrete Infinite Horizon Optimization

Pages:S117–S126

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S117

Reformulation of the Multiperiod MILP Model for Capacity Expansion of Chemical Processes

Pages:S127–S144

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S127

Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case

Pages:S145–S156

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S145

The Structure of Structured Bond Portfolio Models

Pages:S157–S169

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S157

Technical Note

Free Access
One-Half Approximation Algorithms for the k-Partition Problem

Pages:S170–S173

Published Online:February 1, 1992

https://doi.org/10.1287/opre.40.1.S170

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.