199 | -- | 207 | Guilherme Kunigami, Pedro J. de Rezende, Cid C. de Souza, Tallys H. Yunes. Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation |
208 | -- | 221 | Hongyan Liu, Yinghui (Catherine) Yang, Zhuohua Chen, Yong Zheng. A Tree-Based Contrast Set-Mining Approach to Detecting Group Differences |
222 | -- | 237 | Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey. On the Practical Strength of Two-Row Tableau Cuts |
238 | -- | 252 | Hung-Pin Kao, Kwei Tang. Cost-Sensitive Decision Tree Induction with Label-Dependent Late Constraints |
253 | -- | 268 | David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker. Optimization Bounds from Binary Decision Diagrams |
269 | -- | 279 | Athanassios N. Avramidis. Constructing Discrete Unbounded Distributions with Gaussian-Copula Dependence and Given Rank Correlation |
280 | -- | 289 | John Gunnar Carlsson, Fan Jia, Ying Li. An Approximation Algorithm for the Continuous k-Medians Problem in a Convex Polygon |
290 | -- | 302 | Chase Rainwater, Joseph Geunes, H. Edwin Romeijn. Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand |
303 | -- | 320 | Volkan Yazici, Cevdet Aykanat. Constrained Min-Cut Replication for K-Way Hypergraph Partitioning |
321 | -- | 335 | Mohammad Javad Feizollahi, Igor Averbakh. The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows |
336 | -- | 350 | Amitabh Basu, Jesús A. De Loera, Mark Junod. On Chubanov's Method for Linear Programming |
351 | -- | 369 | Gediminas Adomavicius, YoungOk Kwon. Optimization-Based Approaches for Maximizing Aggregate Recommendation Diversity |
370 | -- | 384 | Vural Aksakalli, Ibrahim Ari. Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem |
385 | -- | 400 | L. Jeff Hong, Zhaolin Hu, Liwei Zhang. Conditional Value-at-Risk Approximation to Value-at-Risk Constrained Programs: A Remedy via Monte Carlo |
401 | -- | 413 | Kalyan T. Talluri. New Formulations for Choice Network Revenue Management |