Turnpike Horizons for Production Planning

Pages:229–241

Published Online:March 1, 1980

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

Integer Programming Models for Sales Resource Allocation

Pages:242–260

Published Online:March 1, 1980

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

A Competitive Scenario Modeling System

Pages:261–273

Published Online:March 1, 1980

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

A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem

Pages:274–281

Published Online:March 1, 1980

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

An Implicit Enumeration Algorithm for Quadratic Integer Programming

Pages:282–296

Published Online:March 1, 1980

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

An Economics Approach to Modeling the Productivity of Computer Systems

Pages:297–311

Published Online:March 1, 1980

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

Implicit Intransitivity Under Majority Rule with Mixed Motions

Pages:312–321

Published Online:March 1, 1980

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

Structure in 5's: A Synthesis of the Research on Organization Design

Pages:322–341

Published Online:March 1, 1980

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

Free Access
Erratum to “Planning Horizon Procedures for Machine Replacement Models”

Pages:342–342

Published Online:March 1, 1980

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

Free Access
Erratum to “Optimal Pilfering Policies for Dynamic Continuous Thieves”

Pages:342–342

Published Online:March 1, 1980

https://doi.org/10.1287/mnsc.26.3.342a

Free Access
About Authors

Pages:343–344

Published Online:March 1, 1980

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

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.