Help
Cart
Skip main navigation

Available Issues

April 12, 2013 - April 13, 2026

Available Issues

April 12, 2013 - April 13, 2026

Editor's Introduction

Free Access
Editor's Introduction

Pages:85–85

Published Online:May 1, 1991

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

Preview Abstract

Research Article

Optimal Partial-Match Hashing Design

Pages:86–91

Published Online:May 1, 1991

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

Preview Abstract
Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8

Pages:92–106

Published Online:May 1, 1991

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

Preview Abstract
Unique Names Violations, a Problem for Model Integration or You Say Tomato, I Say Tomahto

Pages:107–120

Published Online:May 1, 1991

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

Preview Abstract
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut

Pages:121–134

Published Online:May 1, 1991

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

Preview Abstract
Column Generation Methods for Probabilistic Logic

Pages:135–148

Published Online:May 1, 1991

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

Preview Abstract
A Computational Study of the Job-Shop Scheduling Problem

Pages:149–156

Published Online:May 1, 1991

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

Preview Abstract
Locating Minimal Infeasible Constraint Sets in Linear Programs

Pages:157–168

Published Online:May 1, 1991

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

Preview Abstract

Technical Note

Free Access
Technical Note—Least-Squares Image Registration

Pages:169–172

Published Online:May 1, 1991

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

Preview Abstract

SOFTWARE SECTION

Free Access
SOFTWARE SECTION—RANDMOD: A System for Randomizing Modifications to an Instance of a Linear Program

Pages:173–175

Published Online:May 1, 1991

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

Preview Abstract

Book Review

Free Access
Book Review

Pages:176–176

Published Online:May 1, 1991

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

Preview Abstract
Previous
Back to Top
Next
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.
Agree