INFORMS Journal on Computing, Volume 16

Volume 16, Number 1, 2004

• W. David Kelton:
  From the Editor. 1
  
• Institute for Operations Research and the Management Sciences. 2
  
• Eva K. Lee:
  Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment. 3-26
  
• Zong-Zhi Lin, James C. Bean, Chelsea C. White III:
  A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes. 27-38
  
• Wilbert E. Wilhelm, Radu Gadidov:
  A Branch-and-Cut Approach for a Generic Multiple-Product, Assembly-System Design Problem. 39-55
  
• Alexandra Makri, Diego Klabjan:
  A New Pricing Scheme for Airline Crew Scheduling. 56-67
  
• Mihoko V. Bennett, Thomas R. Willemain:
  The Filtered Nearest Neighbor Method for Generating Low-Discrepancy Sequences. 68-72
  
• Gyana R. Parija, Shabbir Ahmed, Alan J. King:
  On Bridging the Gap Between Stochastic Integer Programming and MIP Solver Technologies. 73-83
  
• Sourour Elloumi, Martine Labbé, Yves Pochet:
  A New Formulation and Resolution Method for the p-Center Problem. 83-94
  
• Syam Menon, Ali Amiri:
  Scheduling Banner Advertisements on the Web. 95-105
  

Volume 16, Number 2, 2004

• W. David Kelton:
  From the Editor. 107
  
• Institute for Operations Research and the Management Sciences. 108
  
• Richard D. McBride, John W. Mamer:
  Implementing an LU Factorization for the Embedded Network Simplex Algorithm. 109-119
  
• Willem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie:
  Computer-Aided Complexity Classification of Dial-a-Ride Problems. 120-132
  
• Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover:
  An Ejection Chain Approach for the Generalized Assignment Problem. 133-151
  
• John Shortle, Percy H. Brill, Martin J. Fischer, Donald Gross, Denise M. Bevilacqua Masi:
  An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue. 152-161
  
• Jeffery L. Kennington, Karen R. Lewis:
  Generalized Networks: The Theory of Preprocessing and an Empirical Analysis. 162-173
  
• Jeffery L. Kennington, Eli V. Olinick:
  Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures. 174-187
  
• Alain Billionnet, Éric Soutif:
  Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem. 188-197
  
• Francis Sourd:
  The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions. 198-208
  

Volume 16, Number 3, 2004

• W. David Kelton:
  From the Editor. 209
  
• Institute for Operations Research and the Management Sciences. 210
  
• Harvey J. Greenberg, William E. Hart, Giuseppe Lancia:
  Opportunities for Combinatorial Optimization in Computational Biology. 211-231
  
• Jacek Blazewicz, Fred Glover, Marta Kasprzak:
  DNA Sequencing - Tabu and Scatter Search Combined. 232-240
  
• Sadan Kulturel-Konak, Bryan A. Norman, David W. Coit, Alice E. Smith:
  Exploiting Tabu Search Memory in Constrained Problems. 241-254
  
• John W. Chinneck:
  The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs. 255-265
  
• Barry L. Nelson, Michael R. Taaffe:
  The Ph_t/Ph_t/infinity Queueing System: Part I - The Single Node. 266-274
  
• Barry L. Nelson, Michael R. Taaffe:
  The [Pht/Pht/infinity]^K Queueing System: Part II - The Multiclass Network. 275-283
  
• Hui-Chin Tang, Chiang Kao:
  Searching for Good Multiple Recursive Random Number Generators via a Genetic Algorithm. 284-290
  
• K. A. Ariyawansa, Andrew J. Felt:
  On a New Collection of Stochastic Linear Programming Test Problems. 291-299
  
• Amy Nicole Langville, William J. Stewart:
  Testing the Nearest Kronecker Product Preconditioner on Markov Chains and Stochastic Automata Networks. 300-315
  
• Yves Pochet, Mathieu Van Vyve:
  A General Heuristic for Production Planning Problems. 316-327
  

Volume 16, Number 4, 2004

• Harvey J. Greenberg:
  From the Guest Editor for the Special Issue on Computational Molecular Biology/Bioinformatics. 329-330
  
• David S. H. Chew, Kwok Pui Choi, Hans Heidner, Ming-Ying Leung:
  Palindromes in SARS and Other Coronaviruses. 331-340
  
• Yonil Park, John L. Spouge:
  Searching for Multiple Words in a Markov Sequence. 341-347
  
• Giuseppe Lancia, Maria Cristina Pinotti, Romeo Rizzi:
  Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms. 348-359
  
• Gad Kimmel, Roded Sharan, Ron Shamir:
  Computational Problems in Noisy SNP and Haplotype Analysis: Block Scores, Block Identification, and Population Stratification. 360-370
  
• Jonathan P. K. Doye, Robert H. Leary, Marco Locatelli, Fabio Schoen:
  Global Optimization of Morse Clusters by Potential Energy Transformations. 371-379
  
• Bernard Chazelle, Carl Kingsford, Mona Singh:
  A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies. 380-392
  
• Rumen Andonov, Stefan Balev, Nicola Yanev:
  Protein Threading: From Mathematical Models to Parallel Implementations. 393-405
  
• Genetha Anne Gray, Tamara G. Kolda, Ken Sale, Malin M. Young:
  Optimizing an Empirical Scoring Function for Transmembrane Protein Structure Determination. 406-418
  
• Cláudio Nogueira de Meneses, Zhaosong Lu, Carlos A. S. Oliveira, Panos M. Pardalos:
  Optimal Solutions for the Closest-String Problem via Integer Programming. 419-429
  
• Winfried Just, Gianluca Della Vedova:
  Multiple Sequence Alignment as a Facility-Location Problem. 430-440
  
• Abdullah N. Arslan, Ömer Egecioglu:
  Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints. 441-458
  
• Dan Gusfield, Satish Eddhu, Charles H. Langley:
  The Fine Structure of Galls in Phylogenetic Networks. 459-469
  
• Courtney Stanton, J. MacGregor Smith:
  Steiner Trees and 3-D Macromolecular Conformation. 470-485
  
• W. David Kelton:
  Appreciation to Referees. 486-489