Research Article

Almost Perfect Matrices and Graphs

Pages:1–18

Published Online:February 1, 2001

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

On the Matrix-Cut Rank of Polyhedra

Pages:19–30

Published Online:February 1, 2001

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

A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths

Pages:31–49

Published Online:February 1, 2001

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

Option Pricing with a General Marked Point Process

Pages:50–66

Published Online:February 1, 2001

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

Cumulative Prospect Theory for Parametric and Multiattribute Utilities

Pages:67–81

Published Online:February 1, 2001

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

On the Value of Some Infinite Matrix Games

Pages:82–88

Published Online:February 1, 2001

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

Shapley-Shubik and Banzhaf Indices Revisited

Pages:89–104

Published Online:February 1, 2001

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

Lipschitzian Multifunctions and a Lipschitzian Inverse Mapping Theorem

Pages:105–118

Published Online:February 1, 2001

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

On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems

Pages:119–146

Published Online:February 1, 2001

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

Simplex-Like Trajectories on Quasi-Polyhedral Sets

Pages:147–162

Published Online:February 1, 2001

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

On the Throughput of a Resource Sharing Model

Pages:163–173

Published Online:February 1, 2001

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

Probability Bounds with Cherry Trees

Pages:174–192

Published Online:February 1, 2001

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

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.