Research Article

On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data

Pages:769–792

Published Online:November 1, 1997

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

Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem

Pages:793–802

Published Online:November 1, 1997

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

A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences

Pages:803–813

Published Online:November 1, 1997

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

Nearly Optimal Competitive Online Replacement Policies

Pages:814–839

Published Online:November 1, 1997

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

Analysis of Simple Algorithms for Dynamic Load Balancing

Pages:840–871

Published Online:November 1, 1997

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

How Does the Value Function of a Markov Decision Process Depend on the Transition Probabilities?

Pages:872–885

Published Online:November 1, 1997

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

The Throughput of Irreducible Closed Markovian Queueing Networks: Functional Bounds, Asymptotic Loss, Efficiency, and the Harrison-Wein Conjectures

Pages:886–920

Published Online:November 1, 1997

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

The Delay of Open Markovian Queueing Networks: Uniform Functional Bounds, Heavy Traffic Pole Multiplicities, and Stability

Pages:921–954

Published Online:November 1, 1997

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

Cooperation Indices and Weighted Shapley Values

Pages:955–968

Published Online:November 1, 1997

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

Centers of Monotone Generalized Complementarity Problems

Pages:969–976

Published Online:November 1, 1997

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

Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints

Pages:977–997

Published Online:November 1, 1997

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

α-Covex Sets and Strong Quasiconvexity

Pages:998–1022

Published Online:November 1, 1997

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

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.