Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem

Pages:1–21

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.1

Preview Abstract
Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions

Pages:22–31

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.22

Preview Abstract
A Linearization Method for Nonsmooth Stochastic Programming Problems

Pages:32–49

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.32

Preview Abstract
Hermite Normal Form Computation Using Modulo Determinant Arithmetic

Pages:50–59

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.50

Preview Abstract
Structured Policies for a Sequential Design Problem with General Distributions

Pages:60–71

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.60

Preview Abstract
Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes

Pages:72–96

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.72

Preview Abstract
Linear Systems for Constrained Matching Problems

Pages:97–120

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.97

Preview Abstract
On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials

Pages:121–148

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.121

Preview Abstract
Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem

Pages:149–162

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.149

Preview Abstract
On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain Case

Pages:163–176

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.163

Preview Abstract
Martingale Inequalities and NP-Complete Problems

Pages:177–181

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.177

Preview Abstract
Free Access
Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem

Pages:182–184

Published Online:February 1, 1987

https://doi.org/10.1287/moor.12.1.182

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