Algorithm Selection for Combinatorial Search Problems: A Survey
From MaRDI portal
Publication:4988865
DOI10.1007/978-3-319-50137-6_7zbMath1461.68218arXiv1210.7959OpenAlexW1526726828MaRDI QIDQ4988865
Publication date: 20 May 2021
Published in: Data Mining and Constraint Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7959
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General topics in the theory of algorithms (68W01)
Related Items (9)
Variable ordering for decision diagrams: a portfolio approach ⋮ Instance space analysis and algorithm selection for the job shop scheduling problem ⋮ Speeding up neural network robustness verification via algorithm configuration and an optimised mixed integer linear programming solver portfolio ⋮ Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection ⋮ Automated streamliner portfolios for constraint satisfaction problems ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma ⋮ Deep learning assisted heuristic tree search for the container pre-marshalling problem ⋮ Neural large neighborhood search for routing problems
This page was built for publication: Algorithm Selection for Combinatorial Search Problems: A Survey
