Journal: INFORMS Journal on Computing

Volume 21, Issue 3

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