Real-time solving of computationally hard problems using optimal algorithm portfolios
type: Item
instance of: scholarly article
title: Real-time solving of computationally hard problems using optimal algorithm portfolios
author: Yair Nof
author: Ofer Strichman
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2021-08-02T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7377245
zbMATH Keywords: algorithm portfolios
zbMATH Keywords: NP-optimization
zbMATH Keywords: real-time systems
describes a project that uses: Paramils
describes a project that uses: EasyLocal++
describes a project that uses: SMAC
describes a project that uses: VCC
describes a project that uses: Localizer
describes a project that uses: irace
describes a project that uses: Dafny
describes a project that uses: z3
describes a project that uses: Oz
MaRDI profile type: Publication
full work available at URL: s10472-020-09704-4
OpenAlex ID: W3082569663
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Algorithm portfolios
cites work: Distributed Constraint-Based Local Search
cites work: Q5472387
cites work: ParamILS: An Automatic Algorithm Configuration Framework
cites work: Optimization by Simulated Annealing
cites work: Reducibility Among Combinatorial Problems
cites work: Dafny: An Automatic Program Verifier for Functional Correctness
cites work: Localizer: A Modeling Language for Local Search
cites work: An analysis of approximations for maximizing submodular set functions—I
cites work: Learning parallel portfolios of algorithms
cites work: Q4828558
cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
cites work: The Design of Approximation Algorithms
DOI: 10.1007/S10472-020-09704-4
description: scientific article; zbMATH DE number 7377245