Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers

Pages:1–5

Published Online:February 1, 1984

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

Preview Abstract
Multiplicative Markov Decision Chains

Pages:6–24

Published Online:February 1, 1984

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

Preview Abstract
An Application of the Aumann-Shapley Prices for Cost Allocation in Transportation Problems

Pages:25–42

Published Online:February 1, 1984

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

Preview Abstract
On Random Binary Trees

Pages:43–65

Published Online:February 1, 1984

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

Preview Abstract
Diagonality of Cost Allocation Prices

Pages:66–74

Published Online:February 1, 1984

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

Preview Abstract
A Newton-Type Algorithm for the Solution of the Implicit Programming Problem

Pages:75–86

Published Online:February 1, 1984

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

Preview Abstract
Lipschitz Behavior of Solutions to Convex Minimization Problems

Pages:87–111

Published Online:February 1, 1984

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

Preview Abstract
Discretization and Weak Convergence in Markov Decision Drift Processes

Pages:112–141

Published Online:February 1, 1984

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

Preview Abstract
Tight Bounds and Probabilistic Analysis of Two Heuristics for Parallel Processor Scheduling

Pages:142–150

Published Online:February 1, 1984

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

Preview Abstract
Life Lengths and Association: A Dynamic Approach

Pages:151–158

Published Online:February 1, 1984

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

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