INFORMS Journal on Computing, Volume 18

Volume 18, Number 1, 2006

• From the Editor. 1-
  

• Michael E. Kuhl, Sachin G. Sumant, James R. Wilson:
  An Automated Multiresolution Procedure for Modeling Complex Arrival Processes. 3-18
  
• Diane L. Evans, Lawrence Leemis, John H. Drew:
  The Distribution of Order Statistics for Discrete Random Variables with Applications to Bootstrapping. 19-30
  
• Huseyin Topaloglu, Warren B. Powell:
  Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems. 31-42
  
• Joel A. Shapiro, Warren B. Powell:
  A Metastrategy for Large-Scale Resource Management Based on Informational Decomposition. 43-60
  
• Antonio Frangioni, Antonio Manca:
  A Computational Study of Cost Reoptimization for Min-Cost Flow Problems. 61-70
  
• Michele Monaci, Paolo Toth:
  A Set-Covering-Based Heuristic Approach for Bin-Packing Problems. 71-85
  
• Gérard Cornuéjols, Miroslav Karamanov, Yanjun Li:
  Early Estimates of the Size of Branch-and-Bound Trees. 86-96
  
• José H. Dulá, Francisco J. López:
  Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron. 97-110
  
• Miguel F. Anjos, Anthony Vannelli:
  A New Mathematical-Programming Framework for Facility-Layout Design. 111-118
  
• Anurag Agarwal, Varghese S. Jacob, Hasan Pirkul:
  An Improved Augmented Neural-Network Approach for Scheduling Problems. 119-128
  
• John J. H. Forrest, Jayant Kalagnanam, Laszlo Ladányi:
  A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints. 129-134
  

Volume 18, Number 2, Spring 2006

• John W. Chinneck:
  From the Guest Editor - Special Cluster on Operations Research in Electrical and Computer Engineering. 135-136
  
• Laleh Behjat, Anthony Vannelli, William Rosehart:
  Integer Linear Programming Models for Global Routing. 137-150
  
• Sin Ming Loo, B. Earl Wells:
  Task Scheduling in a Finite-Resource, Reconfigurable Hardware/Software Codesign Environment. 151-172
  
• Praveen Pai, Emad Gad, Ramachandra Achar, Michel S. Nakhla, Roni Khazaka:
  A Projection-Based Reduction Approach to Computing Sensitivity of Steady-State Response of Nonlinear Circuits. 173-185
  
• Shirook M. Ali, Natalia K. Nikolova, Mohamed H. Bakr:
  A Discrete Adjoint Variable Method for Printed-Circuit Board Computer-Aided Design. 186-196
  
• Dorothy Kucar, Anthony Vannelli:
  Using Eigenvectors to Partition Circuits. 197-208
  
• Ruslan Sadykov, Laurence A. Wolsey:
  Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates. 209-217
  
• Seok Ho Chang, Dae Won Choi:
  Modeling and Performance Analysis of a Finite-Buffer Queue with Batch Arrivals, Batch Services, and Setup Times: The M^X/G^Y/1/K + B Queue with Setup Times. 218-228
  
• Debabrata Dey, Zhongju Zhang, Prabuddha De:
  Optimal Synchronization Policies for Data Warehouses. 229-242
  
• Kaushik Dutta, Samit Soni, Sridhar Narasimhan, Anindya Datta:
  Optimization in Object Caching. 243-254
  
• Hemant K. Bhargava, Daewon Sun, Susan H. Xu:
  Stockout Compensation: Joint Inventory and Price Optimization in Electronic Retailing. 255-266
  
• Xiao Fang, Olivia R. Liu Sheng, Wei Gao, Balakrishna R. Iyer:
  A Data-Mining-Based Prefetching Approach to Caching for Network Storage Systems. 267-282
  

Volume 18, Number 3, Summer 2006

• Darrell Conklin, Christina Anagnostopoulou:
  Segmental Pattern Discovery in Music. 285-293
  
• Emilia Gómez:
  Tonal Description of Polyphonic Audio for Music Content Processing. 294-304
  
• Elaine Chew:
  Slicing It All Ways: Mathematical Models for Tonal Induction, Approximation, and Segmentation Using the Spiral Array. 305-320
  
• Judy A. Franklin:
  Recurrent Neural Networks for Music Computation. 321-338
  
• Alexandra L. Uitdenbogerd, Abhijit Chattaraj, Justin Zobel:
  Methodologies for Evaluation of Note-Based Music-Retrieval Systems. 339-347
  
• Ioannis Gamvros, Bruce L. Golden, S. Raghavan:
  The Multilevel Capacitated Minimum Spanning Tree Problem. 348-365
  
• Joakim Kalvenes, Jeffery L. Kennington, Eli V. Olinick:
  Base Station Location and Service Assignments in W - CDMA Networks. 366-376
  
• Guidong Zhu, Jonathan F. Bard, Gang Yu:
  A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem. 377-390
  
• Stefan Irnich, Daniel Villeneuve:
  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3. 391-406
  

Volume 18, Number 4, Fall 2006

• W. David Kelton:
  From the Editor. 407
  
• Joseph Abate, Ward Whitt:
  A Unified Framework for Numerically Inverting Laplace Transforms. 408-421
  
• Ramesh Bollapragada, Yanjun Li, Uday S. Rao:
  Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks. 422-432
  
• Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia:
  A Memetic Heuristic for the Generalized Quadratic Assignment Problem. 433-443
  
• Jie Sun, Xinwei Liu:
  Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method. 444-454
  
• Linda S. Moonen, Frits C. R. Spieksma:
  Exact Algorithms for a Loading Problem with Bounded Clique Width. 455-465
  
• Gerhard Reinelt, Klaus Michael Wenger:
  Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem. 466-479
  
• Andrea Lodi, Michela Milano, Louis-Martin Rousseau:
  Discrepancy-Based Additive Bounding Procedures. 480-493
  
• Xiaoming Huo, Seoung Bum Kim, Kwok-Leung Tsui, Shuchun Wang:
  FBP: A Frontier-Based Tree-Pruning Algorithm. 494-505
  
• Yong Tan, Yonghua Ji, Vijay S. Mookerjee:
  Analyzing Document-Duplication Effects on Policies for Browser and Proxy Caching. 506-522