On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees

Pages:1–14

Published Online:February 1, 1983

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

A Light-Traffic Theorem for Multi-Server Queues

Pages:15–25

Published Online:February 1, 1983

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

Smoothed Functionals in Stochastic Optimization

Pages:26–33

Published Online:February 1, 1983

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

Polarities Given by Systems of Bilinear Inequalities

Pages:34–41

Published Online:February 1, 1983

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

Multi-Stage Planning and the Extended Linear-Quadratic-Gaussian Control Problem

Pages:42–63

Published Online:February 1, 1983

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

On the Existence of Pareto Efficient Points

Pages:64–73

Published Online:February 1, 1983

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

Extreme Points of Certain Sets of Probability Measures, with Applications

Pages:74–85

Published Online:February 1, 1983

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

Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level

Pages:86–99

Published Online:February 1, 1983

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

An Algorithm for the Open-Shop Problem

Pages:100–109

Published Online:February 1, 1983

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

Team Guessing with Lacunary Information

Pages:110–121

Published Online:February 1, 1983

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

Analysis of a Dynamic Duopoly Model of Advertising

Pages:122–134

Published Online:February 1, 1983

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

Convergence Rates of the Ellipsoid Method on General Convex Functions

Pages:135–150

Published Online:February 1, 1983

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

Stimulating Prices in a Stochastic Model of Resource Allocation

Pages:151–157

Published Online:February 1, 1983

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

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.