Real-time solving of computationally hard problems using optimal algorithm portfolios

DOI10.1007/s10472-020-09704-4OpenAlexW3082569663MaRDI QIDQ2043446

Ofer Strichman, Yair Nof

Publication date: 2 August 2021

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-020-09704-4

zbMATH Keywords

real-time systemsalgorithm portfoliosNP-optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms in computer science (68W99)

Uses Software

• Dafny
• Paramils
• EasyLocal++
• z3
• Oz
• VCC
• irace
• Localizer
• SMAC

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Future paths for integer programming and links to artificial intelligence
• Learning parallel portfolios of algorithms
• The Design of Approximation Algorithms
• Dafny: An Automatic Program Verifier for Functional Correctness
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
• Distributed Constraint-Based Local Search
• Reducibility Among Combinatorial Problems
• ParamILS: An Automatic Algorithm Configuration Framework
• An analysis of approximations for maximizing submodular set functions—I
• Localizer: A Modeling Language for Local Search
• Algorithm portfolios

This page was built for publication: Real-time solving of computationally hard problems using optimal algorithm portfolios