Paramils
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Tuning metaheuristics. A machine learning Perspective
- Hyperheuristics
- March_eq
- emili
- SMAC3
- pSMAC
- CAPOPT
- ACVIZ
- HHBQP
- SatEx
- ParaDisEO
- GAPS
- UBCSAT
- OPNET
- LIBOPT
- EasyLocal++
- Effect of transformations of numerical parameters in automatic algorithm configuration
- Best practices for comparing optimization algorithms
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
- ALIAS: a modular tool for finding backdoors for SAT
- The complexity of probabilistic lobbying
- SAT competition
- On the impact of configuration on abstract argumentation automated reasoning
- Exploring variable neighborhood search for automatic algorithm configuration
- Efficient benchmarking of algorithm configurators via model-based surrogates
- PROXIMUS
- BG-WalkSAT
- Revisiting simulated annealing: a component-based analysis
- RPOLY
- Star-topology decoupled state space search
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- Markov chain methods for the bipartite Boolean quadratic programming problem
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- Measuring instance difficulty for combinatorial optimization problems
- Optimisation of interacting particle systems for rare event estimation
- SATzilla
- SPOT
- HyFlex
- Methods for improving the efficiency of swarm optimization algorithms. A survey
- race
- irace
- CCGbank
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
- Real-time solving of computationally hard problems using optimal algorithm portfolios
- The voice of optimization
- Cooperative parallel SAT local search with path relinking
- MultiETSC: automated machine learning for early time series classification
- Gurobi Mex
- ASPARTIX
- Runsolver
- OptiLog: a framework for SAT-based systems
- PyDGGA: distributed GGA for automatic configuration
- The \textsc{MergeSat} solver
- Cunf
- URBiVA
- Boosting evolutionary algorithm configuration
- Model-based algorithm configuration with adaptive capping and prior distributions
- Learning pseudo-backdoors for mixed integer programs
- Sugar
- Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
- D-FLAT
- Reference point based archived many objective simulated annealing
- BitBlaze
- Proteus
- Azucar
- Generation techniques for linear programming instances with controllable properties
- A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
- Automatically improving the anytime behaviour of optimisation algorithms
- An ant colony optimization approach for the multidimensional knapsack problem
- Tuning BARON using derivative-free optimization algorithms
- Automatic algorithm design for hybrid flowshop scheduling problems
- ACOTSP
- ppfolio
- meSAT: multiple encodings of CSP to SAT
- The consultation timetabling problem at Danish high schools
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- claspfolio 2
- A Lagrangian propagator for artificial neural networks in constraint programming
- Evolution-inspired local improvement algorithm solving orienteering problem
- pfolioUZK
- OPAL
- Treengeling
- JCell
- Algorithm 709
- SATenstein
- SATenstein: automatically building local search SAT solvers from components
- On the importance of domain model configuration for automated planning engines
- On the impact of the performance metric on efficient algorithm configuration
- A computational study on ant colony optimization for the traveling salesman problem with dynamic demands
- Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization
- Capping methods for the automatic configuration of optimization algorithms
- A survey of adaptive large neighborhood search algorithms and applications
- ASlib
- E-MaLeS
- MaxSAT by improved instance-specific algorithm configuration
- 2DCPackGen
- Synthesis of domain specific CNF encoders for bit-vector solvers
- SpyBug: automated bug detection in the configuration space of SAT solvers
- Spybug
This page was built for software: Paramils
