Free Access
From the Editor

Pages:225–225

Published Online:August 1, 1992

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

Research Article

Jackknifing under a Budget Constraint

Pages:226–234

Published Online:August 1, 1992

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

Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm

Pages:235–249

Published Online:August 1, 1992

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

A New Multiplier Adjustment Procedure for the Distributed Computation of Routing Assignments in Virtual Circuit Data Networks

Pages:250–266

Published Online:August 1, 1992

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

Implementing the Simplex Method: The Initial Basis

Pages:267–284

Published Online:August 1, 1992

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

Alternative Approaches to Feasibility in Projective Methods for Linear Programming

Pages:285–299

Published Online:August 1, 1992

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

Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1

Pages:300–310

Published Online:August 1, 1992

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

Simulated Annealing with a Temperature Dependent Penalty Function

Pages:311–319

Published Online:August 1, 1992

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

Solving the Steiner Tree Problem on a Graph Using Branch and Cut

Pages:320–335

Published Online:August 1, 1992

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

Numerical Experiments with Iteration and Aggregation for Markov Chains

Pages:336–350

Published Online:August 1, 1992

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

A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem

Pages:351–356

Published Online:August 1, 1992

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

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.