Research Article

A Polynomial Combinatorial Algorithm for Generalized Minimum Cost Flow

Pages:445–459

Published Online:August 1, 2002

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

A Generalization of the Perfect Graph Theorem Under the Disjunctive Index

Pages:460–469

Published Online:August 1, 2002

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

Combining Problem Structure with Basis Reduction to Solve a Class of Hard Integer Programs

Pages:470–484

Published Online:August 1, 2002

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

The Stable Allocation (or Ordinal Transportation) Problem

Pages:485–503

Published Online:August 1, 2002

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

Project Scheduling in AND–OR Graphs: A Generalization of Dijkstra's Algorithm

Pages:504–517

Published Online:August 1, 2002

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

Minimizing Service and Operation Costs of Periodic Scheduling

Pages:518–544

Published Online:August 1, 2002

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

Achieving Target State-Action Frequencies in Multichain Average-Reward Markov Decision Processes

Pages:545–566

Published Online:August 1, 2002

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

Approximating Subdifferentials by Random Sampling of Gradients

Pages:567–584

Published Online:August 1, 2002

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

Properties of the Log-Barrier Function on Degenerate Nonlinear Programs

Pages:585–613

Published Online:August 1, 2002

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

The Theory of 2-Regularity for Mappings with Lipschitzian Derivatives and its Applications to Optimality Conditions

Pages:614–635

Published Online:August 1, 2002

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

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.