PyDGGA: distributed GGA for automatic configuration

DOI10.1007/978-3-030-80223-3_2OpenAlexW3184585096MaRDI QIDQ2118281FDOQ2118281

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

satisfiabilityautomatic algorithm configuration

Mathematics Subject Classification ID

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

Cites Work

• Paramils: an automatic algorithm configuration framework
• Title not available (Why is that?)
• MaxSAT by improved instance-specific algorithm configuration
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Tuning parameters of large neighborhood search for the machine reassignment problem

Cited In (3)

• Configuring mixed-integer programming solvers for large-scale instances
• PyDGGA
• The first AI4TSP competition: learning to solve stochastic routing problems

Uses Software

• Paramils
• SMAC
• AClib
• Sparrow2Riss

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)