Algorithm runtime prediction: methods \& evaluation
From MaRDI portal
Publication:490455
DOI10.1016/j.artint.2013.10.003zbMath1334.68185arXiv1211.0906OpenAlexW2964281761WikidataQ59585930 ScholiaQ59585930MaRDI QIDQ490455
Holger H. Hoos, Frank Hutter, Lin Xu, Kevin Leyton-Brown
Publication date: 27 August 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.0906
mixed integer programmingpropositional satisfiabilityperformance predictionresponse surface modelstravelling salesperson problemsupervised machine learningempirical performance modelshighly parameterized algorithms
Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)
Related Items
Online over time processing of combinatorial problems, Portfolio approaches for constraint optimization problems, ASlib: a benchmark library for algorithm selection, On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem, A new class of hard problem instances for the 0-1 knapsack problem, Portfolio theorem proving and prover runtime prediction for geometry, A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX, Adaptive online scheduling of tasks with anytime property on heterogeneous resources, Major 2 Satisfiability Logic in Discrete Hopfield Neural Network, On learning and branching: a survey, On the importance of domain model configuration for automated planning engines, On the impact of configuration on abstract argumentation automated reasoning, Combinatorial search from an energy perspective, Optimal decision trees for the algorithm selection problem: integer programming based approaches, A data-driven \textit{meta}-learning recommendation model for multi-mode resource constrained project scheduling problem, AutonoML: Towards an Integrated Framework for Autonomous Machine Learning, Automatic construction of optimal static sequential portfolios for AI planning and beyond, Features for the 0-1 knapsack problem based on inclusionwise maximal solutions, SUNNY-CP and the MiniZinc challenge, Bayesian additive regression trees using Bayesian model averaging, Metalearning and algorithm selection: progress, state of the art and introduction to the 2018 special issue, Efficient benchmarking of algorithm configurators via model-based surrogates, A study on the effects of normalized TSP features for automated algorithm selection, Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes, Generation techniques for linear programming instances with controllable properties, The configurable SAT solver challenge (CSSC), Empirical decision model learning, A PAC Approach to Application-Specific Algorithm Selection, Random sampling and machine learning to understand good decompositions, How we designed winning algorithms for abstract argumentation and which insight we attained, Toward optimal probabilistic active learning using a Bayesian approach, The algorithm selection competitions 2015 and 2017, Wombit: a portfolio bit-vector solver using word-level propagation, Automatic model training under restrictive time constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discovering the suitability of optimisation algorithms by learning from evolved instances
- Learning dynamic algorithm portfolios
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- Efficient global optimization of expensive black-box functions
- Lipschitzian optimization without the Lipschitz constant
- The design and analysis of computer experiments.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Measuring instance difficulty for combinatorial optimization problems
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem
- Experimental research in evolutionary computation. The new experimentalism
- Algorithm Survival Analysis
- Mixed Models for the Analysis of Optimization Algorithms
- Response Surfaces, Mixtures, and Ridge Analyses
- Empirical hardness models
- Regression Trees for Censored Data
- Online Estimation of SAT Solving Runtime
- Hierarchical Hardness Models for SAT
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- Estimating the Efficiency of Backtrack Programs
- Theory and Applications of Satisfiability Testing
- Structural Abstraction of Software Verification Conditions
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2004
- Random forests
