swMATH8008MaRDI QIDQ20023FDOQ20023
Author name not available (Why is that?)
Official website: http://iridia.ulb.ac.be/irace/
Cited In (only showing first 100 items - show all)
- Pitfalls and best practices in algorithm configuration
- A unified ant colony optimization algorithm for continuous optimization
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- Scheduling of maintenance work of a large-scale tramway network
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- psoptim
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
- A study on the pickup and delivery problem with time windows: matheuristics and new instances
- CPU Benchmarks
- An experimental study of operator choices in the \((1+(\lambda,\lambda))\) genetic algorithm
- A destroy and repair algorithm for the bike sharing rebalancing problem
- A GRASP for the convex recoloring problem in graphs
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem
- A hybrid metaheuristic approach for the capacitated arc routing problem
- A multi-agent based cooperative approach to scheduling and routing
- Local search heuristics for sectoring routing in a household waste collection context
- Large neighborhood search for multi-trip vehicle routing
- Hybrid evolutionary search for the traveling repairman problem with profits
- Tree optimization based heuristics and metaheuristics in network construction problems
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
- AClib
- COBAYN
- Algorithm 97
- OpenTuner
- GAMUT
- math.js
- PARPAP
- DANN
- kernDeepStackNet
- asm.js
- LS-II
- GAPJS
- glpk.js
- jsLPSolver
- scmamp
- node-lp_solve
- Numericjs
- sunny-cp
- RowLayout
- RobinX
- SCCWalk
- Nevergrad
- spatiasql.js
- SpatiaLite
- moko
- automl
- DriveML
- weightedHypervolume
- GAUL
- BO-BSG
- JavaPermutationTools
- IOHanalyzer
- IOHexperimenter
- IOHprofiler
- Performance Assessment
- sgcp-via-cliques
- Integer programming model extensions for a multi-stage nurse rostering problem
- CCLS
- MATILDA
- Advisor
- GPS Visualizer
- CP Optimizer
- AutoFolio
- DACBench
- GenericWrapper4AC
- HPOlib
- pyrgg
- Optunity
- PSPSO
- jMetalPy
- Ifpack2
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem
- Improved heuristic algorithms for the job sequencing and tool switching problem
- The configurable SAT solver challenge (CSSC)
- Two phased hybrid local search for the periodic capacitated arc routing problem
- Automatic construction of parallel portfolios via algorithm configuration
- Automatically improving the anytime behaviour of optimisation algorithms
- Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- A hybrid heuristic for the maximum dispersion problem
- aspeed: solver scheduling via answer set programming
- A metaheuristic based on tabu search for solving a technician routing and scheduling problem
- Client-side computational optimization
- Group-based synchronous-asynchronous grey wolf optimizer
- Automatic algorithm design for hybrid flowshop scheduling problems
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
- Exact and heuristic methods for optimizing lock-quay system in inland waterway
- An effective iterated tabu search for the maximum bisection problem
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem
- Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Modification of the method of generation of control finite-state machines with continuous actions based on training examples
- Revisiting simulated annealing: a component-based analysis
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
- Automatic model selection for high-dimensional survival analysis
This page was built for software: irace
