Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Relaxation Methods for Pure and Mixed Integer Programming Problems

Pages:229–239

Published Online:January 1, 1972

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

Preview Abstract
The Efficiency of Computer Algorithms for Plant Layout

Pages:240–248

Published Online:January 1, 1972

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

Preview Abstract
Stochastic Growth Models

Pages:249–264

Published Online:January 1, 1972

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

Preview Abstract
Inventory Control with Probabilistic Demand and Periodic Withdrawals

Pages:265–275

Published Online:January 1, 1972

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

Preview Abstract
Utility Functions for Multiattributed Consequences

Pages:276–287

Published Online:January 1, 1972

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

Preview Abstract
Machine Replacement with Stochastic Costs

Pages:288–298

Published Online:January 1, 1972

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

Preview Abstract
A Generalized Lagrange Multiplier Algorithm for Optimum or Near Optimum Production Scheduling

Pages:299–311

Published Online:January 1, 1972

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

Preview Abstract
Equilibria of Polymatrix Games

Pages:312–318

Published Online:January 1, 1972

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

Preview Abstract
Purchasing Priorities in Queues

Pages:319–326

Published Online:January 1, 1972

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

Preview Abstract
A Facilities in Series Inventory Model with Nested Schedules

Pages:327–338

Published Online:January 1, 1972

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

Preview Abstract
Notes—Note on “Markovian Decision Models for Reject Allowance Problems”

Pages:339–343

Published Online:January 1, 1972

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

Preview Abstract
Previous
Back to Top
Next
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.
Agree