INFORMS Journal on Computing, Volume 20

Volume 20, Number 1, Winter 2008

• Jonathan Eckstein, Avigdor Gal, Sarit Reiner:
  Monitoring an Information Source Under a Politeness Constraint. 3-20
  
• H. Neil Geismar, Gilbert Laporte, Lei Lei, Chelliah Sriskandarajah:
  The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan. 21-33
  
• San-Yih Hwang, Wan-Shiou Yang:
  Discovering Generalized Profile-Association Rules for the Targeted Advertising of New Products. 34-45
  
• Namsik Chang, Olivia R. Liu Sheng:
  Decision-Tree-Based Knowledge Discovery: Single- vs. Multi-Decision-Tree Induction. 46-54
  
• Oscar Cordón, Sergio Damas, Jose Santamaría, Rafael Martí:
  Scatter Search for the Point-Matching Problem in 3D Image Registration. 55-68
  
• Fernando S. Oliveira:
  A Constraint Logic Programming Algorithm for Modeling Dynamic Pricing. 69-77
  
• Ruibin Bai, Graham Kendall:
  A Model for Fresh Produce Shelf-Space Allocation and Inventory Management with Freshness-Condition-Dependent Demand. 78-85
  
• Massimiliano Caramia, Paolo Dell'Olmo, Giuseppe F. Italiano:
  Novel Local-Search-Based Approaches to University Examination Timetabling. 86-99
  
• Ravi Bapna, Sanjukta Das, Robert S. Garfinkel, Jan Stallaert:
  A Market Design for Grid Computing. 100-111
  
• Hulisi Ogut, Huseyin Cavusoglu, Srinivasan Raghunathan:
  Intrusion-Detection Policies for IT Security Breaches. 112-123
  
• Jörg Homberger:
  A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem. 124-132
  
• Louis-Philippe Bigras, Michel Gamache, Gilles Savard:
  Time-Indexed Formulations and the Total Weighted Tardiness Problem. 133-142
  
• Luc Mercier, Pascal Van Hentenryck:
  Edge Finding for Cumulative Scheduling. 143-153
  
• Christos D. Tarantilis, Emmanouil E. Zachariadis, Chris T. Kiranoudis:
  A Hybrid Guided Local Search for the Vehicle-Routing Problem with Intermediate Replenishment Facilities. 154-168
  

Volume 20, Number 2, Spring 2008

• Jaya Singhal, Kalyan Singhal:
  A Noniterative Algorithm for the Linear-Quadratic Profit-Maximization Model for Smoothing Multiproduct Production. 169-178
  
• Qi-Ming He, Hanqin Zhang:
  An Algorithm for Computing Minimal % Coxian Representations. 179-190
  
• Luciana S. Buriol, Mauricio G. C. Resende, Mikkel Thorup:
  Speeding Up Dynamic Shortest-Path Algorithms. 191-204
  
• Irit Katriel:
  Matchings in Node-Weighted Convex Bipartite Graphs. 205-211
  
• Mhand Hifi, Rym M'Hallah, Toufik Saadi:
  Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem. 212-221
  
• Konstantin Artiouchine, Philippe Baptiste, Juliette Mattioli:
  The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints. 222-233
  
• Abderezak Touzene:
  A Tensor Sum Preconditioner for Stochastic Automata Networks. 234-242
  
• F. Sibel Salman, R. Ravi, John N. Hooker:
  Solving the Capacitated Local Access Network Design Problem. 243-254
  
• José Niño-Mora:
  A Faster Index Algorithm and a Computational Study for Bandits with Switching Costs. 255-269
  
• Stefan Irnich:
  A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics. 270-287
  
• Sumit Kunnumkal, Huseyin Topaloglu:
  Exploiting the Structural Properties of the Underlying Markov Decision Problem in the Q-Learning Algorithm. 288-301
  
• Enrico Malaguti, Michele Monaci, Paolo Toth:
  A Metaheuristic Approach for the Vertex Coloring Problem. 302-316
  
• Haldun Aytug, Gary J. Koehler, Ling He:
  Risk Minimization and Minimum Description for Linear Discriminant Functions. 317-331
  

Volume 20, Number 3, Summer 2008

• Mauro Dell'Amico, Manuel Iori, Silvano Martello, Michele Monaci:
  Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem. 333-344
  
• Ravi Bapna, Paulo B. Goes, Alok Gupta, Gilbert G. Karuga:
  Predicting Bidders' Willingness to Pay in Online Multiunit Ascending Auctions: Analytical and Empirical Insights. 345-355
  
• Young U. Ryu, Hyeun-Suk Rhee:
  Improving Intrusion Prevention Models: Dual-Threshold and Dual-Filter Approaches. 356-367
  
• Teodor Gabriel Crainic, Guido Perboli, Roberto Tadei:
  Extreme Point-Based Heuristics for Three-Dimensional Bin Packing. 368-384
  
• Hiroshi Haramoto, Makoto Matsumoto, Takuji Nishimura, François Panneton, Pierre L'Ecuyer:
  Efficient Jump Ahead for 2-Linear Random Number Generators. 385-390
  
• Syam Menon, Rakesh Gupta:
  Optimal Broadcast Scheduling in Packet Radio Networks via Branch and Price. 391-399
  
• Christian Roed Pedersen, Lars Relund Nielsen, Kim Allan Andersen:
  The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results. 400-411
  
• Francisco Parreño, Ramón Alvarez-Valdés, José Manuel Tamarit, J. F. Oliveira:
  A Maximal-Space Algorithm for the Container Loading Problem. 412-422
  
• Xue Bai, Rema Padman, Joseph Ramsey, Peter Spirtes:
  Tabu Search-Enhanced Graphical Models for Classification in High Dimensions. 423-437
  
• Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
  A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs. 438-450
  
• Gerardo Minella, Rubén Ruiz, Michele Ciavotta:
  A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem. 451-471
  
• Francis Sourd, Olivier Spanjaard:
  A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem. 472-484
  
• Bahar Biller, Barry L. Nelson:
  Evaluation of the ARTAFIT Method for Fitting Time-Series Input Processes for Simulation. 485-498
  

Volume 20, Number 4, Fall 2008

• Yuelin Shen:
  Reactive Tabu Search in a Team-Learning Problem. 500-509
  
• J. D. Griffiths, G. M. Leonenko, J. E. Williams:
  Approximation to the Transient Solution of the M/Ek/1 Queue. 510-515
  
• Bernardetta Addis, Marco Locatelli, Fabio Schoen:
  Disk Packing in a Square: A New Global Optimization Approach. 516-524
  
• Elizabeth D. Dolan, Robert Fourer, Jean-Pierre Goux, Todd S. Munson, Jason Sarich:
  Kestrel: An Interface from Optimization Modeling Systems to the NEOS Server. 525-538
  
• Hui Xiong, Wenjun Zhou, Mark Brodie, Sheng Ma:
  Top-k Correlation Computation. 539-552
  
• April K. Andreas, J. Cole Smith:
  Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations. 553-564
  
• Shivaram Subramanian, Hanif D. Sherali:
  An Effective Deflected Subgradient Optimization Scheme for Implementing Column Generation for Large-Scale Airline Crew Scheduling Problems. 565-578
  
• Chun-Hung Chen, Donghai He, Michael C. Fu, Loo Hay Lee:
  Efficient Simulation Budget Allocation for Selecting an Optimal Subset. 579-595
  
• Huseyin Topaloglu:
  A Stochastic Approximation Method to Compute Bid Prices in Network Revenue Management Problems. 596-610
  
• Miguel F. Anjos, Anthony Vannelli:
  Computing Globally Optimal Solutions for Single-Row Layout Problems Using Semidefinite Programming and Cutting Planes. 611-617
  
• Christian Blum:
  Beam-ACO for Simple Assembly Line Balancing. 618-627
  
• Feng Yang, Bruce E. Ankenman, Barry L. Nelson:
  Estimating Cycle Time Percentile Curves for Manufacturing Systems via Simulation. 628-643
  
• Mauro Birattari, Prasanna Balaprakash, Thomas Stützle, Marco Dorigo:
  Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem. 644-658