Liqun Qi

The A-Forest Iteration Method for the Stochastic Generalized Transportation Problem
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 1-21. [Abstract] [PDF]  

Clyde L. Monma and Jeffrey B. Sidney

Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 22-31. [Abstract] [PDF]  

Andrzej Ruszczynski

A Linearization Method for Nonsmooth Stochastic Programming Problems
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 32-49. [Abstract] [PDF]  

P. D. Domich, R. Kannan, and L. E. Trotter, Jr.

Hermite Normal Form Computation Using Modulo Determinant Arithmetic
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 50-59. [Abstract] [PDF]  

Harald Benzing and Michael Kolonko

Structured Policies for a Sequential Design Problem with General Distributions
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 60-71. [Abstract] [PDF]  

K. Truemper

Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 72-96. [Abstract] [PDF]  

W. Cook and W. R. Pulleyblank

Linear Systems for Constrained Matching Problems
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 97-120. [Abstract] [PDF]  

J. Renegar

On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 121-148. [Abstract] [PDF]  

John R. Birge and Roger J.-B. Wets

Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 149-162. [Abstract] [PDF]  

Arie Hordijk and Martin L. Puterman

On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain Case
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 163-176. [Abstract] [PDF]  

Wansoo T. Rhee and Michel Talagrand

Martingale Inequalities and NP-Complete Problems
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 177-181. [Abstract] [PDF]  

M. Grötschel and W. R. Pulleyblank

Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
MATHEMATICS OF OPERATIONS RESEARCH 1987 12: 182-184. [Abstract] [PDF]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.