The following pages link to irace (Q20023):
Displaying 50 items.
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms (Q277580) (← links)
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
- A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
- A multi-agent based cooperative approach to scheduling and routing (Q323308) (← links)
- Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
- Large neighborhood search for multi-trip vehicle routing (Q323545) (← links)
- Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas (Q334220) (← links)
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (Q342275) (← links)
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization (Q342297) (← links)
- A destroy and repair algorithm for the bike sharing rebalancing problem (Q342356) (← links)
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems (Q666941) (← links)
- Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance (Q723980) (← links)
- Scheduling of maintenance work of a large-scale tramway network (Q724038) (← links)
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
- Group-based synchronous-asynchronous grey wolf optimizer (Q823422) (← links)
- Region based memetic algorithm for real-parameter optimisation (Q903616) (← links)
- Heuristic search to the capacitated clustering problem (Q1622798) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- A two-stage approach to the UCITS-constrained index-tracking problem (Q1634070) (← links)
- Effect of transformations of numerical parameters in automatic algorithm configuration (Q1634780) (← links)
- Improved heuristic algorithms for the job sequencing and tool switching problem (Q1651541) (← links)
- A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem (Q1651593) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
- A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
- The weighted independent domination problem: integer linear programming models and metaheuristic approaches (Q1681137) (← links)
- Exploring variable neighborhood search for automatic algorithm configuration (Q1687671) (← links)
- Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP (Q1691655) (← links)
- Two phased hybrid local search for the periodic capacitated arc routing problem (Q1694314) (← links)
- Metalearning and algorithm selection: progress, state of the art and introduction to the 2018 special issue (Q1707460) (← links)
- Efficient benchmarking of algorithm configurators via model-based surrogates (Q1707462) (← links)
- LS-II: an improved locust search algorithm for solving optimization problems (Q1720873) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Integer programming model extensions for a multi-stage nurse rostering problem (Q1730747) (← links)
- Exact and heuristic methods for optimizing lock-quay system in inland waterway (Q1737520) (← links)
- Modification of the method of generation of control finite-state machines with continuous actions based on training examples (Q1742411) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- A tailored two-phase constructive heuristic for the three-dimensional multiple bin size bin packing problem with transportation constraints (Q1754206) (← links)
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs (Q1999003) (← links)
