Mathematical Models for Economic and Political Advertising Campaigns

Pages:1–14

Published Online:February 1, 1977

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

The Completion Time of PERT Networks

Pages:15–29

Published Online:February 1, 1977

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

An Algorithm for Two-Dimensional Cutting Problems

Pages:30–44

Published Online:February 1, 1977

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

A Survey of Scheduling Rules

Pages:45–61

Published Online:February 1, 1977

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

Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties

Pages:62–69

Published Online:February 1, 1977

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

Optimal Two-Machine Orderings in the 3 × n Flow-Shop Problem

Pages:70–77

Published Online:February 1, 1977

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

A Condensation Algorithm for a Class of Algebraic Programs

Pages:78–88

Published Online:February 1, 1977

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

Triangular Factorization and Generalized Upper Bounding Techniques

Pages:89–99

Published Online:February 1, 1977

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

Cost Models for Stochastic Clearing Systems

Pages:100–127

Published Online:February 1, 1977

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

Sharp Bounds on the Value of Perfect Information

Pages:128–139

Published Online:February 1, 1977

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

Two Queues in Tandem Attended by a Single Server

Pages:140–147

Published Online:February 1, 1977

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

Free Access
Technical Note—Column Dropping in the Dantzig-Wolfe Convex Programming Algorithm: Computational Experience

Pages:148–155

Published Online:February 1, 1977

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

Free Access
Technical Note—On Sensitivity Analysis in Geometric Programming

Pages:155–163

Published Online:February 1, 1977

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

Free Access
Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem

Pages:163–168

Published Online:February 1, 1977

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

Free Access
Technical Note—Comparison between Two Dynamic Perishable Inventory Models

Pages:168–172

Published Online:February 1, 1977

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

Free Access
Technical Note—Minimax Procedure for a Class of Linear Programs under Uncertainty

Pages:173–177

Published Online:February 1, 1977

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

Free Access
Appreciation to Referees

Pages:179–182

Published Online:February 1, 1977

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

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.