INFORMS Journal on Computing, Volume 8

Volume 8, Number 1, Winter 1996

• Catherine C. McGeoch:
  Feature Article - Toward an Experimental Method for Algorithm Simulation. 1-15
  
• Pierre L'Ecuyer:
  Commentary - Simulation of Algorithms for Performance Analysis. 16-20
  
• James B. Orlin:
  Commentary - On Experimental Methods for Algorithm Simulation. 21-23
  
• Douglas R. Shier:
  Commentary - On Algorithm Analysis. 24-26
  
• Catherine C. McGeoch:
  Rejoinder - Challenges in Algorithm Simulation. 27-28
  
• David P. Williamson, Michel X. Goemans:
  Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances. 29-40
  
• Abraham P. Punnen, K. P. K. Nair:
  An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem. 41-44
  
• J. P. C. Blanc, Robert D. van der Mei:
  Computation of Derivatives by Means of the Power-Series Algorithm. 45-54
  
• John W. Chinneck:
  Localizing and Diagnosing Infeasibilities in Networks. 55-62
  
• Weizhen Mao, David M. Nicol:
  Isomorphic Routing on a Toroidal Mesh. 63-73
  
• Edward P. C. Kao:
  A Comparison of Alternative Approaches for Numerical Solutions of GI/PH/1 Queues. 74-85
  

Volume 8, Number 2, Spring 1996

• Laura A. Sanchis, Arun Jagota:
  Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem. 87-102
  
• Helmut E. Mausser, Michael J. Magazine, John B. Moore:
  Application of an Annealed Neural Network to a Timetabling Problem. 103-117
  
• Shouhong Wang:
  A Self-Organizing Approach to Managerial Nonlinear Discriminant Analysis: A Hybrid Method of Linear Discriminant Analysis and Neural Networks. 118-124
  
• Bruno Codenotti, Giovanni Manzini, Luciano Margara, Giovanni Resta:
  Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP. 125-133
  
• Jacques Renaud, Fayez F. Boctor, Gilbert Laporte:
  A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem. 134-143
  
• Erwin Pesch, Ulrich A. W. Tetzlaff:
  Constraint Propagation Based Scheduling of Job Shops. 144-157
  
• Jean-Yves Potvin, Tanguy Kervahut, Bruno-Laurent Garcia, Jean-Marc Rousseau:
  The Vehicle Routing Problem with Time Windows Part I: Tabu Search. 158-164
  
• Jean-Yves Potvin, Samy Bengio:
  The Vehicle Routing Problem with Time Windows Part II: Genetic Search. 165-172
  
• David W. Coit, Alice E. Smith, David M. Tate:
  Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems. 173-182
  
• Haldun Aytug, Gary J. Koehler:
  Stopping Criteria for Finite Length Genetic Algorithms. 183-191
  

Volume 8, Number 3, Summer 1996

• Youngho Lee, Steve Y. Chiu, Jennifer Ryan:
  A Branch and Cut Algorithm for a Steiner Tree-Star Problem. 194-201
  
• Prakash Mirchandani:
  The Multi-Tier Tree Problem. 202-218
  
• Leslie Hall:
  Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem. 219-234
  
• Rita Vachani, Alexander Shulman, Peter Kubat, Julie Ward:
  Multicommodity Flows in Ring Networks. 235-242
  
• Daniel Bienstock, Oktay Günlük:
  Capacitated Network Design - Polyhedral Structure and Computation. 243-259
  
• Anantaram Balakrishnan, Srimathy Gopalakrishnan:
  Selecting Ingot Sizes for Joint Production of Sheet Products. 260-273
  
• Gabriel R. Bitran, Susana V. Mondschein:
  Inventory Management in Catalog Sales Companies. 274-288
  
• Karen Aardal, Martine Labbé, Janny Leung, Maurice Queyranne:
  On the Two-Level Uncapacitated Facility Location Problem. 289-301
  
• Rob J. M. Vaessens, Emile H. L. Aarts, Jan Karel Lenstra:
  Job Shop Scheduling by Local Search. 302-317
  
• Ravindra K. Ahuja, James B. Orlin:
  Use of Representative Operation Counts in Computational Testing of Algorithms. 318-330
  

Volume 8, Number 4, Fall 1996

• T. Jayawardena, Sidney Yakowitz:
  Methodology for Stochastic Graph Completion-Time Problems. 331-343
  
• Anuj Mehrotra, Michael A. Trick:
  A Column Generation Approach for Graph Coloring. 344-354
  
• James P. Jarvis, Douglas R. Shier:
  An Improved Algorithm for Approximating the Performance of Stochastic Flow Networks. 355-360
  
• Igor Averbakh, Oded Berman:
  Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints. 361-366
  
• Minghe Sun, Ralph E. Steuer:
  Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors. 367-375
  
• C. P. M. van Hoesel, Albert P. M. Wagelmans, M. van Vliet:
  An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds. 376-382
  
• Pai-Chun Ma, Frederic H. Murphy, Edward A. Stohr:
  An Implementation of LPFORM. 383-401
  
• J. A. Hoogeveen, Steef L. van de Velde:
  A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time. 402-412
  
• Joseph Abate, Gagan L. Choudhury, Ward Whitt:
  On the Laguerre Method for Numerically Inverting Laplace Transforms. 413-427
  
• Jan H. M. Korst, Emile H. L. Aarts, Jan Karel Lenstra:
  Scheduling Periodic Tasks. 428-435