Cited in
(only showing first 100 items - show all)- Exact hypervolume subset selection through incremental computations
- Experimental research in evolutionary computation. The new experimentalism
- Evolutionary algorithms for single and multicriteria design optimization
- Automatically improving the anytime behaviour of optimisation algorithms
- Capacity consumption analysis using heuristic solution method for under construction railway routes
- Design and Analysis of Computational Experiments: Overview
- Paramils: an automatic algorithm configuration framework
- Multi-objective combinatorial optimization: problematic and context
- Experimental Methods for the Analysis of Optimization Algorithms
- Efficient multi-start strategies for local search algorithms
- A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
- Robust optimization - a comprehensive survey
- Algorithm portfolio selection as a bandit problem with unbounded losses
- Evolutionary self-adaptation: a survey of operators and strategy parameters
- A unified ant colony optimization algorithm for continuous optimization
- Improving the anytime behavior of two-phase local search
- A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization
- Generating applicable synthetic instances for branch problems
- GLOB
- Hyperheuristics
- Paramils
- SaddleDrop
- EVE-OPT
- CALMA
- EasyLocal++
- Gstat
- BoneRoute
- Knapsack
- LKH
- CMA-ES
- Spacemap
- libagf
- METSlib
- DISCRETA
- ROptEst
- GVF
- SSPMO
- dunn.test
- irace
- ifs
- PDEtools
- MIRPLib
- SMS-EMOA
- CANONIK
- SATenstein
- json2run
- PySCIPOpt
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- GRADIENT
- CBMix
- FES
- CEC 05
- FEMOEA
- SMAC
- flacco
- WorkflowSim
- MLaut
- COBAYN
- PARPAP
- RobinX
- weightedHypervolume
- CAMOS
- Performance Assessment
- MATILDA
- Two phased hybrid local search for the periodic capacitated arc routing problem
- SPOTMisc
- The Sequential Parameter Optimization Toolbox
- Algorithm runtime prediction: methods \& evaluation
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem
- babsim.hospital
- Tuning metaheuristics. A machine learning Perspective
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- Algorithms for the workflow satisfiability problem engineered for counting constraints
- Time-series event-based prediction: an unsupervised learning framework based on genetic programming
- On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
- A decision support tool for generating shipping data for the Hunter Valley coal chain
- Fleet design optimisation from historical data using constraint programming and large neighbourhood search
- Hybrid evolutionary search for the traveling repairman problem with profits
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- Balancing bike sharing systems with constraint programming
- A survey of variants and extensions of the location-routing problem
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
- On the impact of the performance metric on efficient algorithm configuration
- MPILS
- A weighted-sum method for solving the bi-objective traveling thief problem
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- Generation techniques for linear programming instances with controllable properties
- Evolutionary robust optimization in production planning -- interactions between number of objectives, sample size and choice of robustness measure
- HUBBI
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- Sequential model-based parameter optimization: an experimental investigation of automated and interactive approaches
- Feature-based tuning of single-stage simulated annealing for examination timetabling
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
- EpiSIX
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Revisiting simulated annealing: a component-based analysis
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing
- Exploring further advantages in an alternative formulation for the set covering problem
This page was built for software: SPOT
