• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 41 matches

• 1991
• 
  David L. Applegate, William J. Cook:
  A Computational Study of the Job-Shop Scheduling Problem. INFORMS J. Comput. 3(2): 149-156 (1991)
• 
  Kenneth W. Bauer Jr., Bipin Kochar, Joseph J. Talavage:
  Discrete Event Simulation Model Decomposition by Principal Components Analysis. INFORMS J. Comput. 3(1): 23-32 (1991)
• 
  Hemant K. Bhargava, Steven O. Kimbrough, Ramayya Krishnan:
  Unique Names Violations, a Problem for Model Integration or You Say Tomato, I Say Tomahto. INFORMS J. Comput. 3(2): 107-120 (1991)
• 
  John W. Chinneck, Erik W. Dravnieks:
  Locating Minimal Infeasible Constraint Sets in Linear Programs. INFORMS J. Comput. 3(2): 157-168 (1991)
• 
  Joobin Choobineh:
  SQLMP: A Data Sublanguage for Representation and Formulation of Linear Mathematical Models. INFORMS J. Comput. 3(4): 358-375 (1991)
• 
  Frank Dammeyer, Peter Forst, Stefan Voß:
  Technical Note - On the Cancellation Sequence Method of Tabu Search. INFORMS J. Comput. 3(3): 262-265 (1991)
• 
  Peter J. Downey:
  Bounding Synchronization Overhead for Parallel Iteration. INFORMS J. Comput. 3(4): 288-298 (1991)
• 
  Peter C. Fetterolf, G. Anandalingam:
  Optimizing Interconnections of Local Area Networks: An Approach Using Simulated Annealing. INFORMS J. Comput. 3(4): 275-287 (1991)
• 
  Bennett L. Fox, Andrew R. Young:
  Generating Markov-Chain Transitions Quickly: II. INFORMS J. Comput. 3(1): 3-11 (1991)
• 
  Harvey J. Greenberg:
  Editor's Introduction. INFORMS J. Comput. 3(1): 1-2 (1991)
• 
  Harvey J. Greenberg:
  Editor's Introduction. INFORMS J. Comput. 3(2): 85 (1991)
• 
  Harvey J. Greenberg:
  SOFTWARE SECTION - RANDMOD: A System for Randomizing Modifications to an Instance of a Linear Program. INFORMS J. Comput. 3(2): 173-175 (1991)
• 
  Harvey J. Greenberg:
  Editor's Introduction. INFORMS J. Comput. 3(3): 179 (1991)
• 
  Harvey J. Greenberg:
  Editor's Introduction. INFORMS J. Comput. 3(4): 267-268 (1991)
• 
  Harvey J. Greenberg, John W. Chinneck, Gerald M. Karam:
  Book Reviews. INFORMS J. Comput. 3(1): 81-83 (1991)
• 
  Harvey J. Greenberg, Frederic H. Murphy:
  Approaches to Diagnosing Infeasible Linear Programs. INFORMS J. Comput. 3(3): 253-261 (1991)
• 
  Paul Helman, Arnon Rosenthal:
  A Mass Production Technique to Speed Multiple-Query Optimization and Physical Database Design. INFORMS J. Comput. 3(1): 33-55 (1991)
• 
  Karla L. Hoffman, Manfred Padberg:
  Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut. INFORMS J. Comput. 3(2): 121-134 (1991)
• 
  Raj Jagannathan:
  Optimal Partial-Match Hashing Design. INFORMS J. Comput. 3(2): 86-91 (1991)
• 
  Brigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão:
  Column Generation Methods for Probabilistic Logic. INFORMS J. Comput. 3(2): 135-148 (1991)
• 
  Christopher V. Jones:
  An Introduction to Graph-Based Modeling Systems, Part II: Graph-Grammars and the Implementation. INFORMS J. Comput. 3(3): 180-206 (1991)
• 
  Edward P. C. Kao:
  Using State Reduction for Computing Steady State Probabilities of Queues of GI/PH/1 Types. INFORMS J. Comput. 3(3): 231-240 (1991)
• 
  David N. Kempka, Jeffery L. Kennington, Hossam A. Zaki:
  Performance Characteristics of the Jacobi and the Gauss-Seidel Versions of the Auction Algorithm on the Alliant FX/8. INFORMS J. Comput. 3(2): 92-106 (1991)
• 
  Jeffery L. Kennington, Zhiming Wang:
  An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations. INFORMS J. Comput. 3(4): 299-306 (1991)
• 
  Gary J. Koehler:
  Linear Discriminant Functions Determined by Genetic Search. INFORMS J. Comput. 3(4): 345-357 (1991)
• 
  Renato De Leone, Terence T.-H. Ow:
  Parallel Implementation of Lemke's Algorithm on the Hypercube. INFORMS J. Comput. 3(1): 56-62 (1991)
• 
  Weldon A. Lodwick:
  Book Review. INFORMS J. Comput. 3(3): 266 (1991)
• 
  Nimrod Megiddo:
  On Finding Primal- and Dual-Optimal Bases. INFORMS J. Comput. 3(1): 63-65 (1991)
• 
  Benjamin Melamed:
  TES: A Class of Methods for Generating Autocorrelated Uniform Variates. INFORMS J. Comput. 3(4): 317-329 (1991)
• 
  Zbigniew Michalewicz, George A. Vignaux, Matthew Hobbs:
  A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem. INFORMS J. Comput. 3(4): 307-316 (1991)

skipping 11 more matches