Computing Economic Equilibria on Affine Networks with Lemke's Algorithm

Pages:209–214

Published Online:August 1, 1979

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

Sequencing with Series-Parallel Precedence Constraints

Pages:215–224

Published Online:August 1, 1979

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

Renewal Decision Problem-Random Horizon

Pages:225–232

Published Online:August 1, 1979

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

A Greedy Heuristic for the Set-Covering Problem

Pages:233–235

Published Online:August 1, 1979

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

The Partition Value

Pages:236–264

Published Online:August 1, 1979

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

On Fulkerson's Conjecture About Consistent Labeling Processes

Pages:265–267

Published Online:August 1, 1979

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

Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs

Pages:268–273

Published Online:August 1, 1979

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

The Principal Maxmin Matrix Transversal Strategy

Pages:274–290

Published Online:August 1, 1979

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

Penalty Lagrangian Methods Via a Quasi-Newton Approach

Pages:291–302

Published Online:August 1, 1979

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

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.