Research Article

Single-Machine Scheduling Polyhedra with Precedence Constraints

Pages:1–20

Published Online:February 1, 1991

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

The Adequacy of Universal Strategies in Analytic Gambling Problems

Pages:21–41

Published Online:February 1, 1991

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

Facets of the Asymmetric Traveling Salesman Polytope

Pages:42–56

Published Online:February 1, 1991

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

Light Traffic Approximations in Queues

Pages:57–71

Published Online:February 1, 1991

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

Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem

Pages:72–89

Published Online:February 1, 1991

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

A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types

Pages:90–118

Published Online:February 1, 1991

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

Scenarios and Policy Aggregation in Optimization Under Uncertainty

Pages:119–147

Published Online:February 1, 1991

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

The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations

Pages:148–161

Published Online:February 1, 1991

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

Stochastic Analysis of a Modified First Fit Decreasing Packing

Pages:162–175

Published Online:February 1, 1991

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

On Optimal Packing of Randomly Arriving Objects

Pages:176–194

Published Online:February 1, 1991

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

Multichain Markov Decision Processes with a Sample Path Constraint: A Decomposition Approach

Pages:195–207

Published Online:February 1, 1991

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

Max-Balancing Weighted Directed Graphs and Matrix Scaling

Pages:208–222

Published Online:February 1, 1991

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

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.