Editor's Introduction

Free Access
Editor's Introduction

Pages:101–102

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.101

Research Article

Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods

Pages:103–118

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.103

Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem

Pages:119–131

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.119

Generalized Networks: Parallel Algorithms and an Empirical Analysis

Pages:132–145

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.132

The Vehicle Routing Problem with Time Windows: Minimizing Route Duration

Pages:146–154

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.146

An Optimal Algorithm for the Orienteering Tour Problem

Pages:155–165

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.155

Massively Parallel Algorithms for Singly Constrained Convex Programs

Pages:166–181

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.166

The Ca/M/s/m Retrial Queue: A Computational Approach

Pages:182–191

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.182

Using a Hop-Constrained Model to Generate Alternative Communication Network Design

Pages:192–205

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.192

Fast Heuristics for Large Geometric Traveling Salesman Problems

Pages:206–217

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.206

Technical Note

Free Access
Technical Note—On Performance of Path Planning Algorithms in Unknown Terrains

Pages:218–224

Published Online:May 1, 1992

https://doi.org/10.1287/ijoc.4.2.218

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.