INFORMS Journal on Computing, Volume 21

Volume 21, Number 1, Winter 2009

• Alessandro Agnetis, Arianna Alfieri, Gaia Nicosia:
  Single-Machine Scheduling Problems with Generalized Preemption. 1-12
  
• Claudio Arbib, Fabrizio Marinelli:
  Exact and Asymptotically Exact Solutions for a Class of Assortment Problems. 13-25
  
• Rafael Martí, Abraham Duarte, Manuel Laguna:
  Advanced Scatter Search for the Max-Cut Problem. 26-38
  
• Jesús A. De Loera, Raymond Hemmecke, Matthias Köppe:
  Pareto Optima of Multicriteria Integer Linear Programs. 39-48
  
• Hanif D. Sherali, Antoine G. Hobeika, Chawalit Jeenanunta:
  An Optimal Constrained Pruning Strategy for Decision Trees. 49-61
  
• Dionne M. Aleman, H. Edwin Romeijn, James F. Dempsey:
  A Response Surface Approach to Beam Orientation Optimization in Intensity-Modulated Radiation Therapy Treatment Planning. 62-76
  
• Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir:
  Minimax Regret Single-Facility Ordered Median Location Problems on Networks. 77-87
  
• Athanassios N. Avramidis, Nabil Channouf, Pierre L'Ecuyer:
  Efficient Correlation Matching for Fitting Discrete Multivariate Distributions with Arbitrary Marginals and Normal-Copula Dependence. 88-106
  
• Christian Valente, Gautam Mitra, Mustapha Sadki, Robert Fourer:
  Extending Algebraic Modelling Languages for Stochastic Programming. 107-122
  
• Raf Jans:
  Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints. 123-136
  
• Santanu S. Dey, Jean-Philippe P. Richard:
  Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms. 137-150
  
• Giuseppe Lancia, Paolo Serafini:
  A Set-Covering Approach with Column Generation for Parsimony Haplotyping. 151-166
  
• Francis Sourd:
  New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling. 167-175
  

Volume 21, Number 2, Spring 2009

• John W. Chinneck:
  From the Editor. 177
  
• Abhijit Gosavi:
  Reinforcement Learning: A Tutorial Survey and Recent Advances. 178-192
  
• Sigrún Andradóttir, Andrei A. Prudius:
  Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization. 193-208
  
• Assefaw Hadish Gebremedhin, Arijit Tarafdar, Alex Pothen, Andrea Walther:
  Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation. 209-223
  
• Davaatseren Baatar, Natashia Boland, Robert Johnston, Horst W. Hamacher:
  A New Sequential Extraction Heuristic for Optimizing the Delivery of Cancer Radiation Treatment Using Multileaf Collimators. 224-241
  
• Robert Fourer, Leo Lopes:
  StAMPL: A Filtration-Oriented Modeling Tool for Multistage Stochastic Recourse Problems. 242-256
  
• Sven Leyffer:
  A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems. 257-267
  
• Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte:
  Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems. 268-285
  
• Zan Huang, Dennis K. J. Lin:
  The Time-Series Link Prediction Problem with Applications in Communication Surveillance. 286-303
  
• Richard Laundy, Michael Perregaard, Gabriel Tavares, Horia Tipi, Alkis Vazacopoulos:
  Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study. 304-313
  
• Han-Lin Li, Hao-Chun Lu, Chia-Hui Huang, Nian-Ze Hu:
  A Superior Representation Method for Piecewise Linear Functions. 314-321
  
• Enock Chisonge Mofya, Jonathan Cole Smith:
  A Dynamic Programming Algorithm for the Generalized Minimum Filter Placement Problem on Tree Structures. 322-332
  
• Walter Rei, Jean-François Cordeau, Michel Gendreau, Patrick Soriano:
  Accelerating Benders Decomposition by Local Branching. 333-345
  

Volume 21, Number 3, Summer 2009

• John W. Chinneck:
  From the Editor - Special Cluster on High-Throughput Optimization. 347-348
  
• Michael R. Bussieck, Michael C. Ferris, Alexander Meeraus:
  Grid-Enabled Optimization with GAMS. 349-362
  
• Laurent Michel, Andrew See, Pascal Van Hentenryck:
  Transparent Parallelization of Constraint Programming. 363-382
  
• Y. Xu, Ted K. Ralphs, Laszlo Ladányi, Matthew J. Saltzman:
  Computational Experience with a Software Framework for Parallel Integer Programming. 383-397
  
• Michael C. Ferris, Christos T. Maravelias, Arul Sundaramoorthy:
  Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid. 398-410
  
• Rommel G. Regis, Christine A. Shoemaker:
  Parallel Stochastic Global Optimization Using Radial Basis Functions. 411-426
  
• Hao Howard Zhang, Leyuan Shi, Robert R. Meyer, Daryl Nazareth, Warren D. D'Souza:
  Solving Beam-Angle Selection and Dose Optimization Simultaneously via High-Throughput Computing. 427-444
  
• Jeff Linderoth, François Margot, Greg Thain:
  Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing. 445-457
  
• Charles H. Reilly:
  Synthetic Optimization Problem Generation: Show Us the Correlations! 458-467
  
• Jingpeng Li, Uwe Aickelin, Edmund K. Burke:
  A Component-Based Heuristic Search Method with Evolutionary Eliminations for Hospital Personnel Scheduling. 468-479
  
• Yang Yuan, Suvrajeet Sen:
  Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs. 480-487
  
• Xiaoqun Wang:
  Dimension Reduction Techniques in Quasi-Monte Carlo Methods for Option Pricing. 488-504
  
• Edmund K. Burke, Graham Kendall, Glenn Whitwell:
  A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem. 505-516
  

Volume 21, Number 4, Fall 2009

• John W. Chinneck:
  From the Editor. 517
  
• Jean-Yves Potvin:
  State-of-the Art Review - Evolutionary Algorithms for Vehicle Routing. 518-548
  
• Daria Terekhov, J. Christopher Beck, Kenneth N. Brown:
  A Constraint Programming Approach for Solving a Queueing Design and Control Problem. 549-561
  
• Andreas T. Ernst, Vicky H. Mak, Luke R. Mason:
  An Exact Method for the Minimum Cardinality Problem in the Treatment Planning of Intensity-Modulated Radiotherapy. 562-574
  
• Franz Rothlauf:
  An Encoding in Metaheuristics for the Minimum Communication Spanning Tree Problem. 575-584
  
• Lei Lei, Hua Zhong, Wanpracha Art Chaovalitwongse:
  On the Integrated Production and Distribution Problem with Bidirectional Flows. 585-598
  
• Peter Frazier, Warren B. Powell, Savas Dayanik:
  The Knowledge-Gradient Policy for Correlated Normal Beliefs. 599-613
  
• Piyush Kumar, E. Alper Yildirim:
  An Algorithm and a Core Set Result for the Weighted Euclidean One-Center Problem. 614-629
  
• Ira Gerhardt, Barry L. Nelson:
  Transforming Renewal Processes for Simulation of Nonstationary Arrival Processes. 630-640
  
• William Cook, Sanjeeb Dash, Ricardo Fukasawa, Marcos Goycoolea:
  Numerically Safe Gomory Mixed-Integer Cuts. 641-649
  
• John W. Chinneck:
  Appreciation to Referees. 650-653
  

Last update Sat May 18 20:35:53 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page