INFORMS Journal on Computing, Volume 12

Volume 12, Number 1, 2000

• Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh:
  Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. 2-23
  
• Marie Coffin, Matthew J. Saltzman:
  Statistical Analysis of Computational Tests of Algorithms and Heuristics. 24-44
  
• Robert E. Bixby, Alexander Martin:
  Parallelizing the Dual Simplex Method. 45-56
  
• Gerhard J. Woeginger:
  When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? 57-74
  
• David Pisinger:
  A Minimal Algorithm for the Bounded Knapsack Problem. 75-82
  

Volume 12, Number 2, 2000

• Anindya Datta, Igor R. Viguier:
  Handling Sensor Data in Rapidly Changing Environments to Support Soft Real-Time Requirements. 84-103
  
• Igor Averbakh, Oded Berman:
  Minmax Regret Median Location on a Network Under Uncertainty. 104-110
  
• Marjan van den Akker, Cor A. J. Hurkens, Martin W. P. Savelsbergh:
  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation. 111-124
  
• Walter J. Gutjahr, Christine Strauss, Eric Wagner:
  A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management. 125-135
  
• Daniel J. Rosenkrantz, Giri Kumar Tayi, S. S. Ravi:
  Algorithms for Path-Based Placement of Inspection Stations on Networks. 136-149
  
• Jatinder N. D. Gupta, Randall S. Sexton, Enar A. Tunc:
  Selecting Scheduling Heuristics Using Neural Networks. 150-162
  

Volume 12, Number 3, 2000

• Marcelo Prais, Celso C. Ribeiro:
  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment. 164-176
  
• Stefan E. Karisch, Franz Rendl, Jens Clausen:
  Solving Graph Bisection Problems with Semidefinite Programming. 177-191
  
• Karen Aardal, Robert E. Bixby, Cor A. J. Hurkens, Arjen K. Lenstra, Job W. Smeltink:
  Market Split and Basis Reduction: Towards a Solution of the Cornue'jols-Dawande Instances. 192-202
  
• Peter Buchholz, Gianfranco Ciardo, Susanna Donatelli, Peter Kemper:
  Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models. 203-222
  
• Teodor Gabriel Crainic, Michel Gendreau, Judith M. Farvolden:
  A Simplex-Based Tabu Search Method for Capacitated Network Design. 223-236
  
• Luca Maria Gambardella, Marco Dorigo:
  An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem. 237-255
  

Volume 12, Number 4, 2000

• Saul I. Gass, Donald Gross:
  In Memoriam: Carl M. Harris. 257-260
  
• Carl M. Harris, Percy H. Brill, Martin J. Fischer:
  Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis. 261-271
  
• David G. Humphrey, James R. Wilson:
  A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization. 272-283
  
• Hanif D. Sherali, Jonathan Cole Smith, Youngho Lee:
  Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting. 284-298
  
• Mark Vroblefski, Ram Ramesh, Stanley Zionts:
  General Open and Closed Queueing Networks with Blocking: A Unified Framework for Approximation. 299-316
  
• José Miguel Díaz-Báñez, Francisco Gómez, Ferran Hurtado:
  Approximation of Point Sets by 1-Corner Polygonal Chains. 317-323
  
• Spyros Kontogiorgis:
  Practical Piecewise-Linear Approximation for Monotropic Optimization. 324-340
  
• Francis Sourd, Wim Nuijten:
  Multiple-Machine Lower Bounds for Shop-Scheduling Problems. 341-352
  
• Subject Classification and Key Word Index to Volume 12. 358-360