The following pages link to (Q3064527):
Displaying 50 items.
- Fleet design optimisation from historical data using constraint programming and large neighbourhood search (Q265693) (← links)
- Balancing bike sharing systems with constraint programming (Q272022) (← links)
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms (Q277580) (← links)
- ASlib: a benchmark library for algorithm selection (Q286390) (← links)
- A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
- Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem (Q342121) (← 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)
- Region based memetic algorithm for real-parameter optimisation (Q903616) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem (Q1652501) (← links)
- Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading (Q1652699) (← links)
- Two phased hybrid local search for the periodic capacitated arc routing problem (Q1694314) (← links)
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs (Q1695014) (← links)
- A matheuristic for the driver scheduling problem with staff cars (Q1711474) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
- Synergies between operations research and data mining: the emerging use of multi-objective approaches (Q1926877) (← links)
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications (Q2028795) (← links)
- OptiLog: a framework for SAT-based systems (Q2118280) (← links)
- PyDGGA: distributed GGA for automatic configuration (Q2118281) (← links)
- A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem (Q2147081) (← links)
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021 (Q2163749) (← links)
- Boosting evolutionary algorithm configuration (Q2163844) (← links)
- Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
- A novel hybrid PSO-based metaheuristic for costly portfolio selection problems (Q2241553) (← links)
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem (Q2242328) (← links)
- Automatically improving the anytime behaviour of optimisation algorithms (Q2256321) (← links)
- Robust university course timetabling problem subject to single and multiple disruptions (Q2286982) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- Feature-based tuning of single-stage simulated annealing for examination timetabling (Q2398423) (← links)
- A unified ant colony optimization algorithm for continuous optimization (Q2514761) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- Ants can orienteer a thief in their robbery (Q2661549) (← links)
- On the impact of the performance metric on efficient algorithm configuration (Q2667810) (← links)
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling (Q2668746) (← links)
- A weighted-sum method for solving the bi-objective traveling thief problem (Q2669668) (← links)
- Task design in complex crowdsourcing experiments: item assignment optimization (Q2676398) (← links)
- (Q4633074) (← links)
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives (Q5153496) (← links)
- MPILS: an automatic tuner for MILP solvers (Q6047892) (← links)
- Modeling and solving the steelmaking and casting scheduling problem (Q6066683) (← links)
- The double traveling salesman problem with partial last‐in‐first‐out loading constraints (Q6071059) (← links)
- A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation (Q6106564) (← links)
- Hyperparameter autotuning of programs with HybridTuner (Q6113060) (← links)
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem (Q6114925) (← links)
- Exact and metaheuristic methods for a real-world examination timetabling problem (Q6136080) (← links)
