PyDGGA: distributed GGA for automatic configuration

DOI10.1007/978-3-030-80223-3_2MaRDI QIDQ2118281zbMATH OpenOpenAlexFDO

Authors Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-80223-3_2

zbMATH Keywords

automatic algorithm configurationsatisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• MaxSAT by improved instance-specific algorithm configuration
• Paramils: an automatic algorithm configuration framework
• Tuning parameters of large neighborhood search for the machine reassignment problem

Cited in

(5)

• PyDGGA
• The first AI4TSP competition: learning to solve stochastic routing problems
• Configuring mixed-integer programming solvers for large-scale instances
• A method for the automated configuration of anytime portfolios of algorithms
• Realtime gray-box algorithm configuration using cost-sensitive classification

Describes a project that uses

Uses Software

• AClib
• Sparrow2Riss
• SMAC
• Paramils

This page was built for publication: PyDGGA: distributed GGA for automatic configuration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118281)