Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Forecasting Non-Stationary Economic Time Series

Pages:1–21

Published Online:September 1, 1966

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

Preview Abstract
Factors Influencing Market Penetration

Pages:22–41

Published Online:September 1, 1966

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

Preview Abstract
Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities

Pages:42–57

Published Online:September 1, 1966

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

Preview Abstract
Experimental Methods in Quadratic Programming

Pages:58–76

Published Online:September 1, 1966

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

Preview Abstract
The Direct Solution of the Transportation Problem with Reduced Matrices

Pages:77–96

Published Online:September 1, 1966

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

Preview Abstract
An Improved Starting Algorithm for the Ford-Fulkerson Approach to the Transportation Problem

Pages:97–104

Published Online:September 1, 1966

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

Preview Abstract
A Deterministic Multi-Period Production Scheduling Model with Backlogging

Pages:105–119

Published Online:September 1, 1966

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

Preview Abstract
On a Class of Optimal Stock Depletion Policies

Pages:120–130

Published Online:September 1, 1966

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

Preview Abstract
On the Generation of Discount Rates and Implicit Prices Through a Replacement Model

Pages:131–143

Published Online:September 1, 1966

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

Preview Abstract
Programming Variable Factors

Pages:144–151

Published Online:September 1, 1966

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

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