A Comprehensive Planning Model for Long-Range Academic Strategies

Pages:727–738

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.727

On the Concept of the Value of Information in Competitive Situations

Pages:739–747

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.739

An Improved Long-Run Model for Multiple Warehouse Location

Pages:748–758

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.748

Some Easy Postoptimality Analysis for Zero-One Programming

Pages:759–765

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.759

The Use of the Nash Bargaining Model in Trajectory Selection

Pages:766–777

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.766

A Least Total Distance Facility Configuration Problem Involving Lattice Points

Pages:778–787

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.778

A Computational Algorithm for Multi-Contract Bidding Under Constraints

Pages:788–798

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.788

On Risky Investments with Random Timing of Cash Returns and Fixed Planning Horizon

Pages:799–809

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.799

Control Schemes in Queueing Networks

Pages:810–822

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.810

Free Access
Note—A Note on “Lot Size Scheduling on a Single Machine for Stochastic Demand” by Goyal

Pages:823–824

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.823

Free Access
Author's Reply to Vergin's Note on the Paper “Lot Size Scheduling on a Single Machine for Stochastic Demand”

Pages:824–825

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.824

Free Access
Critical Ratio Scheduling: An Experimental Analysis: Erratum

Pages:825–825

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.825

Free Access
Notes About Authors

Pages:826–827

Published Online:March 1, 1976

https://doi.org/10.1287/mnsc.22.7.826

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.