Abstract is missing.
- Learning a Stopping Criterion for Local SearchAlejandro Arbelaez, Barry O'Sullivan. 3-16 [doi]
- Surrogate Assisted Feature Computation for Continuous ProblemsNacim Belkhir, Johann Dréo, Pierre Savéant, Marc Schoenauer. 17-31 [doi]
- MO-ParamILS: A Multi-objective Automatic Algorithm Configuration FrameworkAymeric Blot, Holger H. Hoos, Laetitia Jourdan, Marie-Éléonore Kessaci-Marmion, Heike Trautmann. 32-47 [doi]
- Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP SolversJakob Bossek, Heike Trautmann. 48-59 [doi]
- Extreme Reactive Portfolio (XRP): Tuning an Algorithm Population for Global OptimizationMauro Brunato, Roberto Battiti. 60-74 [doi]
- Bounding the Search Space of the Population Harvest Cutting Problem with Multiple Size Stock SelectionLaura Climent, Barry O'Sullivan, Steven David Prestwich. 75-90 [doi]
- Designing and Comparing Multiple Portfolios of Parameter Configurations for Online Algorithm SelectionAldy Gunawan, Hoong Chuin Lau, Mustafa Misir. 91-106 [doi]
- Portfolios of Subgraph Isomorphism AlgorithmsLars Kotthoff, Ciaran McCreesh, Christine Solnon. 107-122 [doi]
- Structure-Preserving Instance GenerationYuri Malitsky, Marius Merschformann, Barry O'Sullivan, Kevin Tierney. 123-140 [doi]
- Feature Selection Using Tabu Search with Learning Memory: Learning Tabu SearchLucien Mousin, Laetitia Jourdan, Marie-Éléonore Kessaci-Marmion, Clarisse Dhaenens. 141-156 [doi]
- The Impact of Automated Algorithm Configuration on the Scaling Behaviour of State-of-the-Art Inexact TSP SolversZongxu Mu, Holger H. Hoos, Thomas Stützle. 157-172 [doi]
- Requests Management for Smartphone-Based Matching Applications Using a Multi-agent ApproachGilles Simonin, Barry O'Sullivan. 173-186 [doi]
- Self-organizing Neural Network for Adaptive Operator Selection in Evolutionary SearchTeck-Hou Teng, Stephanus Daniel Handoko, Hoong Chuin Lau. 187-202 [doi]
- Quantifying the Similarity of Algorithm ConfigurationsLin Xu, Ashiqur R. KhudaBukhsh, Holger H. Hoos, Kevin Leyton-Brown. 203-217 [doi]
- Neighborhood Synthesis from an Ensemble of MIP and CP ModelsTommaso Adamo, Tobia Calogiuri, Gianpaolo Ghiani, Antonio Grieco, Emanuela Guerriero, Emanuele Manni. 221-226 [doi]
- Parallelizing Constraint Solvers for Hard RCPSP InstancesRoberto Amadini, Maurizio Gabbrielli, Jacopo Mauro. 227-233 [doi]
- Characterization of Neighborhood Behaviours in a Multi-neighborhood Local Search AlgorithmNguyen Dang Thi Thanh, Patrick De Causmaecker. 234-239 [doi]
- Constraint Programming and Machine Learning for Interactive Soccer AnalysisRobinson Duque, Juan Francisco Díaz, Alejandro Arbelaez. 240-246 [doi]
- A Matheuristic Approach for the p-Cable Trench ProblemEduardo Lalla-Ruiz, Silvia Schwarze, Stefan Voß. 247-252 [doi]
- An Empirical Study of Per-instance Algorithm SchedulingMarius Lindauer, Rolf-David Bergdoll, Frank Hutter. 253-259 [doi]
- Dynamic Strategy to Diversify Search Using a History Map in Parallel SolvingSeongsoo Moon, Mary Inaba. 260-266 [doi]
- Faster Model-Based Optimization Through Resource-Aware Scheduling StrategiesJakob Richter, Helena Kotthaus, Bernd Bischl, Peter Marwedel, Jörg Rahnenführer, Michel Lang. 267-273 [doi]
- Risk-Averse Anticipation for Dynamic Vehicle RoutingMarlin W. Ulmer, Stefan Voß. 274-279 [doi]
- Solving GENOPT Problems with the Use of ExaMin SolverKonstantin Barkalov, Alexander Sysoyev, Ilya Lebedev, Vladislav Sovrasov. 283-295 [doi]
- Hybridisation of Evolutionary Algorithms Through Hyper-heuristics for Global Continuous OptimisationEduardo Segredo, Eduardo Lalla-Ruiz, Emma Hart, Ben Paechter, Stefan Voß. 296-305 [doi]