| 331 | -- | 345 | Michele Samorani, Manuel Laguna, Robert Kirk DeLisle, Daniel C. Weaver. A Randomized Exhaustive Propositionalization Approach for Molecule Classification |
| 346 | -- | 363 | Diana M. Negoescu, Peter Frazier, Warren B. Powell. The Knowledge-Gradient Algorithm for Sequencing Experiments in Drug Discovery |
| 364 | -- | 376 | Pierre Brice, Wei Jiang, Guohua Wan. A Cluster-Based Context-Tree Model for Multivariate Data Streams with Applications to Anomaly Detection |
| 377 | -- | 391 | Piyush Kumar, E. Alper Yildirim. A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result |
| 392 | -- | 403 | Osman Y. Özaltin, Brady Hunsaker, Andrew J. Schaefer. Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs |
| 404 | -- | 415 | Samir Elhedhli, Lingzi Li, Mariem Gzara, Joe Naoum-Sawaya. A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts |
| 416 | -- | 424 | Amar Kumar Narisetty, Jean-Philippe P. Richard, George L. Nemhauser. Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study |
| 425 | -- | 429 | Gary J. Koehler. Minimal Equivalent Binary Knapsack Inequalities |
| 430 | -- | 445 | Abdullah Konak, Alice E. Smith. Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach |
| 446 | -- | 459 | Paola Cappanera, Maria Grazia Scutellà. Color-Coding Algorithms to the Balanced Path Problem: Computational Issues |
| 460 | -- | 469 | Daniel Reich, Leo Lopes. Preprocessing Stochastic Shortest-Path Problems with Application to PERT Activity Networks |
| 470 | -- | 482 | Zuo-Jun Max Shen, Roger Lezhou Zhan, Jiawei Zhang. The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms |
| 483 | -- | 492 | Jung-Fa Tsai, Ming-Hua Lin. An Efficient Global Approach for Posynomial Geometric Programming Problems |