Editor's Introduction

Free Access
Editor's Introduction

Pages:267–268

Published Online:November 1, 1991

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

Research Article

Incremental Linear Constraint Solving and Detection of Implicit Equalities

Pages:269–274

Published Online:November 1, 1991

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

Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing

Pages:275–287

Published Online:November 1, 1991

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

Bounding Synchronization Overhead for Parallel Iteration

Pages:288–298

Published Online:November 1, 1991

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

An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations

Pages:299–306

Published Online:November 1, 1991

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

A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem

Pages:307–316

Published Online:November 1, 1991

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

TES: A Class of Methods for Generating Autocorrelated Uniform Variates

Pages:317–329

Published Online:November 1, 1991

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

Rule-Based Generation of Model Structures in Multifaceted Modeling and System Design

Pages:330–344

Published Online:November 1, 1991

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

Linear Discriminant Functions Determined by Genetic Search

Pages:345–357

Published Online:November 1, 1991

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

SQLMP: A Data Sublanguage for Representation and Formulation of Linear Mathematical Models

Pages:358–375

Published Online:November 1, 1991

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

TSPLIB—A Traveling Salesman Problem Library

Pages:376–384

Published Online:November 1, 1991

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

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.