irace

MaRDI QIDQ20023swMATHFDO

Official website http://iridia.ulb.ac.be/irace/

Cited in

(only showing first 100 items - show all)

• EOlib
• GLOB
• Hyperheuristics
• iOpt
• Paramils
• emili
• ALNS
• SMAC3
• psoptim
• pSMAC
• HGS-CVRP
• CAPOPT
• ACVIZ
• HHBQP
• TSPLIB
• Visiplan
• GRASP
• PERL
• GridSim
• PISA
• ParaDisEO
• LSSPER
• GAPS
• MOTGA
• MEMOTS
• MDVRPTW
• COMET
• Heuristic search to the capacitated clustering problem
• A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
• EasyLocal++
• A two-stage approach to the UCITS-constrained index-tracking problem
• Effect of transformations of numerical parameters in automatic algorithm configuration
• Improved heuristic algorithms for the job sequencing and tool switching problem
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• An exact algorithm for the partition coloring problem
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• An effective iterated tabu search for the maximum bisection problem
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
• An effective heuristic algorithm for the partial shop scheduling problem
• Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
• A biased random-key genetic algorithm for the maximum quasi-clique problem
• A memetic algorithm for the cost-oriented robotic assembly line balancing problem
• The weighted independent domination problem: integer linear programming models and metaheuristic approaches
• Exploring variable neighborhood search for automatic algorithm configuration
• TSPTW
• Knapsack
• LKH
• Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP
• Two phased hybrid local search for the periodic capacitated arc routing problem
• CirCut
• LocalSolver
• Metalearning and algorithm selection: progress, state of the art and introduction to the 2018 special issue
• Efficient benchmarking of algorithm configurators via model-based surrogates
• LEMON
• Spacemap
• LS-II: an improved locust search algorithm for solving optimization problems
• Revisiting simulated annealing: a component-based analysis
• Integer programming model extensions for a multi-stage nurse rostering problem
• VRP
• Exact and heuristic methods for optimizing lock-quay system in inland waterway
• Modification of the method of generation of control finite-state machines with continuous actions based on training examples
• Scatter Search
• Heuristics for a flowshop scheduling problem with stepwise job objective function
• A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints
• A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints
• METSlib
• DARCLASS
• SATzilla
• SPOT
• MULKNAP
• MOEA/D
• SPEA2
• VNDS
• LPAm+
• HyFlex
• TTTPLOTS
• Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
• race
• A model of anytime algorithm performance for bi-objective optimization
• NuMVC
• BHOSLIB
• Tree optimization based heuristics and metaheuristics in network construction problems
• A hybrid algorithm for time-dependent vehicle routing problem with time windows
• A hybrid heuristic for the maximum dispersion problem
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
• Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
• Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
• A comparative analysis of two matheuristics by means of merged local optima networks
• Multi-trip time-dependent vehicle routing problem with time windows
• Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search
• Real-time solving of computationally hard problems using optimal algorithm portfolios
• The voice of optimization
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
• Tabu search
• A beam search approach to the traveling tournament problem
• A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
• Runsolver

This page was built for software: irace