Help
Cart
Skip main navigation

Available Issues

April 10, 2013 - May 8, 2026

Available Issues

April 10, 2013 - May 8, 2026

Sensitive Optimality Criteria in Countable State Dynamic Programming

Pages:1–14

Published Online:February 1, 1977

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

Preview Abstract
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes

Pages:15–19

Published Online:February 1, 1977

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

Preview Abstract
Periods of Connected Networks and Powers of Nonnegative Matrices

Pages:20–24

Published Online:February 1, 1977

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

Preview Abstract
Computation of Solutions to Nonlinear Equations Under Homotopy Invariance

Pages:25–29

Published Online:February 1, 1977

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

Preview Abstract
Approximations of Two-Attribute Utility Functions

Pages:30–44

Published Online:February 1, 1977

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

Preview Abstract
Decision Problems with Expected Utility Critera, I: Upper and Lower Convergent Utility

Pages:45–53

Published Online:February 1, 1977

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

Preview Abstract
Some Stochastic Bounds for Dams and Queues

Pages:54–63

Published Online:February 1, 1977

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

Preview Abstract
Individual Rationality and Nash's Solution to the Bargaining Problem

Pages:64–65

Published Online:February 1, 1977

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

Preview Abstract
Valid Inequalities and Superadditivity for 0–1 Integer Programs

Pages:66–77

Published Online:February 1, 1977

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

Preview Abstract
Optimal Replacement with Semi-Markov Shock Models Using Discounted Costs

Pages:78–90

Published Online:February 1, 1977

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

Preview Abstract
Stationary Markovian Decision Problems and Perturbation Theory of Quasi-Compact Linear Operators

Pages:91–102

Published Online:February 1, 1977

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

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