INFORMS Journal on Computing, Volume 9

Volume 9, Number 1, Winter 1997

• Mohan Bala, R. Kipp Martin:
  A Mathematical Programming Approach to Data Base Normalization. 1-14
  
• Jonathan Eckstein:
  How Much Communication Does Parallel Branch and Bound Need? 15-29
  
• Gintaras Palubeckis:
  A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem. 30-42
  
• Djangir A. Babayev, Fred Glover, Jennifer Ryan:
  A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination. 43-50
  

• Ger Koole:
  On the Use of the Power Series Algorithm for General Markov Processes, with an Application to a Petri Net. 51-56
  
• Pierre L'Ecuyer:
  Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences. 57-60
  
• Teodor Gabriel Crainic, Michel Toulouse, Michel Gendreau:
  Toward a Taxonomy of Parallel Tabu Search Heuristics. 61-72
  
• Jacek Gondzio:
  Presolove Analysis of Linear Programs Prior to Applying an Interior Point Method. 73-91
  
• Han Hoogeveen, Steef L. van de Velde:
  Earliness-Tardiness Scheduling Around Almost Equal Due Dates. 92-99
  
• Joy Bhadury, V. Chandru, A. Maheshwari, Ramaswamy Chandrasekaran:
  Art Gallery Problems for Convex Nested Polygons. 100-110
  

Volume 9, Number 2, Spring 1997

• John R. Birge:
  Stochastic Programming Computation and Applications. 111-133
  

• Gordon P. Wright, N. Dan Worobetz, Myong Kang, Radha V. Mookerjee, Radha Chandrasekharan:
  OR/SM: A Prototype Integrated Modeling Environment Based on Structured Modeling. 134-153
  
• Richard D. McBride, John W. Mamer:
  Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm. 154-163
  
• John W. Chinneck:
  Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program. 164-174
  
• Gagan L. Choudhury, Ward Whitt:
  Probabilistic Scaling for the Numerical Inversion of Nonprobability Transforms. 175-184
  
• Christian H. Bischof, Ali Bouaricha, Peyvand M. Khademi, Jorge J. Moré:
  Computing Gradients in Large-Scale Optimization Using Automatic Differentiation. 185-194
  
• Bryan L. Deuermeyer, Guy L. Curry, Andrew T. Duchowski, Srilakshmi Venkatesh:
  An Automatic Approach to Deadlock Detection and Resolution in Discrete Simulation Systems. 195-205
  
• Pierre L'Ecuyer, Raymond Couture:
  An Implementation of the Lattice and Spectral Tests for Multiple Recursive Linear Random Number Generators. 206-217
  
• David M. Cohen, Daniel P. Heyman, Asya Rabinovitch, Danit Brown:
  A Parallel Implementation of the GTH Algorithm. 218-223
  
• Daryl J. Daley, Leslie D. Servi:
  Estimating Waiting Times from Transactional Data. 224-229
  

Volume 9, Number 3, Summer 1997

• Colin R. Reeves:
  Genetic Algorithms for the Operations Researcher. 231-250
  

• Ravindra K. Ahuja, James B. Orlin:
  Developing Fitter Genetic Algorithms. 251-253
  
• Aaron Kershenbaum:
  When Genetic Algorithms Work Best. 254-255
  
• David Levine:
  Genetic Algorithms: A Practitioner's View. 256-259
  
• Peter Ross:
  What Are Genetic Algorithms Good at? 260-262
  

• Colin R. Reeves:
  Genetic Algorithms: No Panacea, but a Valuable Tool for the Operations Researcher. 263-265
  

• Oleg V. Verner, Roger L. Wainwright, Dale A. Schoenefeld:
  Placing Text Labels an Maps and Diagrams using Genetic Algorithms with Masking. 266-275
  
• Srinivasan R. Chakravarthy, Lan Bin:
  A Finite Capacity Queue with Nonrenewal Input and Exponential Dynamic Group Services. 276-287
  
• Andrew G. Glen, Lawrence Leemis, John H. Drew:
  A Generalized Univariate Change-of-Variable Transformation Technique. 288-295
  
• George S. Fishman, L. Stephen Yarberry:
  An Implementation of the Batch Means Method. 296-310
  
• Kristin P. Bennett, Erin J. Bredensteiner:
  A Parametric Optimization Method for Machine Learning. 311-318
  

Volume 9, Number 4, Fall 1997

• Armin Scholl, Robert Klein:
  SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing. 319-334
  
• Anulark Pinnoi, Wilbert E. Wilhelm:
  A Branch and Cut Approach for Workload Smoothing on Assembly Lines. 335-350
  
• Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra:
  Scheduling Periodic Tasks with Slack. 351-362
  
• B. A. Kijowski, Udatta S. Palekar:
  Optimal Resource Assignment of Preemptive Periodic Tasks on Multiple Processors. 363-373
  
• Bharat K. Kaku, Joseph B. Mazzola:
  A Tabu-Search Heuristic for the Dynamic Plant Layout Problem. 374-384
  

• Catherine K. Murphy, Michel Benaroch:
  Adding Value to Induced Decision Trees for Time-Sensitive Data. 385-396
  
• Kaushal Chari, Tarun K. Sen:
  An Integrated Modeling System for Structured Modeling Using Model Graphs. 397-416
  
• Wen-Chyuan Chiang, Robert A. Russell:
  A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows. 417-430
  
• Geon Cho, Dong X. Shaw:
  A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem. 431-438
  
• I. Kuban Altinel, B. John Oommen, Necati Aras:
  Vector Quantization for Arbitrary Distance Function Estimation. 439-451