Abstract is missing.
- From Sequential Algorithm Selection to Parallel Portfolio SelectionMarius Thomas Lindauer, Holger H. Hoos, Frank Hutter. 1-16 [doi]
- An Algorithm Selection Benchmark of the Container Pre-marshalling ProblemKevin Tierney, Yuri Malitsky. 17-22 [doi]
- ADVISER: A Web-Based Algorithm Portfolio DeviserMustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau. 23-28 [doi]
- Identifying Best Hyperparameters for Deep Architectures Using Random ForestsZhen-Zhen Li, Zhuo-Yao Zhong, Lian-Wen Jin. 29-42 [doi]
- Programming by Optimisation Meets Parameterised Algorithmics: A Case Study for Cluster EditingSepp Hartung, Holger H. Hoos. 43-58 [doi]
- OSCAR: Online Selection of Algorithm Portfolios with Case Study on Memetic AlgorithmsMustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau. 59-73 [doi]
- Learning a Hidden Markov Model-Based Hyper-heuristicWillem Van Onsem, Bart Demoen, Patrick De Causmaecker. 74-88 [doi]
- Comparison of Parameter Control Mechanisms in Multi-objective Differential EvolutionMartin Drozdik, Hernán E. Aguirre, Youhei Akimoto, Kiyoshi Tanaka. 89-103 [doi]
- Genetic Programming, Logic Design and Case-Based Reasoning for Obstacle AvoidanceAndy J. Keane. 104-118 [doi]
- Minimizing Total Tardiness on Identical Parallel Machines Using VNS with Learning MemoryEduardo Lalla-Ruiz, Stefan Voß. 119-124 [doi]
- Dynamic Service Selection with Optimal Stopping and 'Trivial Choice'Oliver Skroch. 125-130 [doi]
- A Comparative Study on Self-Adaptive Differential Evolution Algorithms for Test Functions and a Real-World ProblemShota Eguchi, Yuki Matsugano, Hirokazu Sakaguchi, Satoshi Ono, Hisato Fukuda, Ryo Furukawa, Hiroshi Kawasaki. 131-136 [doi]
- Empirical Analysis of Operators for Permutation Based ProblemsPierre Desport, Matthieu Basseur, Adrien Goëffon, Frédéric Lardeux, Frédéric Saubion. 137-150 [doi]
- Fitness Landscape of the Factoradic Representation on the Permutation Flowshop Scheduling ProblemMarie-Eléonore Marmion, Olivier Regnier-Coudert. 151-164 [doi]
- Exploring Non-neutral Landscapes with Neutrality-Based Local SearchMatthieu Basseur, Adrien Goëffon, Hugo Traverson. 165-169 [doi]
- A Selector Operator-Based Adaptive Large Neighborhood Search for the Covering Tour ProblemLeticia Vargas, Nicolas Jozefowiez, Sandra Ulrich Ngueveu. 170-185 [doi]
- Metaheuristics for the Two-Dimensional Container Pre-Marshalling ProblemAlan Tus, Andrea Rendl, Günther R. Raidl. 186-201 [doi]
- Improving the State of the Art in Inexact TSP Solving Using Per-Instance Algorithm SelectionLars Kotthoff, Pascal Kerschke, Holger Hoos, Heike Trautmann. 202-217 [doi]
- A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment ProblemEduardo Lalla-Ruiz, Stefan Voß. 218-222 [doi]
- DYNAMOP Applied to the Unit Commitment ProblemSophie Jacquin, Laetitia Jourdan, El-Ghazali Talbi. 223-228 [doi]
- Scalarized Lower Upper Confidence Bound AlgorithmMadalina M. Drugan. 229-235 [doi]
- Generating Training Data for Learning Linear Composite Dispatching Rules for SchedulingHelga Ingimundardottir, Thomas Philip Runarsson. 236-248 [doi]
- A Practical Case of the Multiobjective Knapsack Problem: Design, Modelling, Tests and AnalysisBrahim Chabane, Matthieu Basseur, Jin-Kao Hao. 249-255 [doi]
- A Bayesian Approach to Constrained Multi-objective OptimizationPaul Feliot, Julien Bect, Emmanuel Vázquez. 256-261 [doi]
- Solving Large MultiZenoTravel Benchmarks with Divide-and-EvolveAlexandre Quemy, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant. 262-267 [doi]
- Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxCliqueChu Min Li, Hua Jiang, Ru Chu Xu. 268-274 [doi]
- Reusing the Same Coloring in the Child Nodes of the Search Tree for the Maximum Clique ProblemAlexey Nikolaev, Mikhail Batsyn, Pablo San Segundo. 275-280 [doi]
- A Warped Kernel Improving Robustness in Bayesian Optimization Via Random EmbeddingsMickaël Binois, David Ginsbourger, Olivier Roustant. 281-286 [doi]
- Making EGO and CMA-ES Complementary for Global OptimizationHossein Mohammadi, Rodolphe Le Riche, Eric Touboul. 287-292 [doi]
- MO-Mine_clust: A Framework for Multi-objective ClusteringBenjamin Fisset, Clarisse Dhaenens, Laetitia Jourdan. 293-305 [doi]
- A Software Interface for Supporting the Application of Data Science to OptimisationAndrew J. Parkes, Ender Özcan, Daniel Karapetyan. 306-311 [doi]