Journal: INFORMS Journal on Computing

Volume 12, Issue 4

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

Volume 12, Issue 3

164 -- 176Marcelo Prais, Celso C. Ribeiro. Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
177 -- 191Stefan E. Karisch, Franz Rendl, Jens Clausen. Solving Graph Bisection Problems with Semidefinite Programming
192 -- 202Karen 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
203 -- 222Peter Buchholz, Gianfranco Ciardo, Susanna Donatelli, Peter Kemper. Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models
223 -- 236Teodor Gabriel Crainic, Michel Gendreau, Judith M. Farvolden. A Simplex-Based Tabu Search Method for Capacitated Network Design
237 -- 255Luca Maria Gambardella, Marco Dorigo. An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem

Volume 12, Issue 2

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

Volume 12, Issue 1

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