The following pages link to SPOT (Q18474):
Displaying 38 items.
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications (Q2028795) (← links)
- A bi-objective heuristic approach for green identical parallel machine scheduling (Q2029023) (← links)
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms (Q2029299) (← links)
- Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach (Q2080825) (← links)
- Rollout-based routing strategies with embedded prediction: a fish trawling application (Q2108157) (← 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)
- Schrödinger wave functional in quantum Yang-Mills theory from precanonical quantization (Q2194221) (← links)
- Generation techniques for linear programming instances with controllable properties (Q2220897) (← 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)
- Automatically improving the anytime behaviour of optimisation algorithms (Q2256321) (← links)
- Automatic algorithm design for hybrid flowshop scheduling problems (Q2286868) (← links)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- Feature-based tuning of single-stage simulated annealing for examination timetabling (Q2398423) (← links)
- Experimental research in evolutionary computation. The new experimentalism (Q2492011) (← links)
- A unified ant colony optimization algorithm for continuous optimization (Q2514761) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← 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)
- Exact hypervolume subset selection through incremental computations (Q2669566) (← 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)
- Generating Applicable Synthetic Instances for Branch Problems (Q2846416) (← links)
- Experimental Methods for the Analysis of Optimization Algorithms (Q3058164) (← links)
- Design and Analysis of Computational Experiments: Overview (Q3064515) (← links)
- The Sequential Parameter Optimization Toolbox (Q3064529) (← links)
- Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches (Q3064530) (← links)
- Efficient Multi-Start Strategies for Local Search Algorithms (Q3087026) (← links)
- FUZZY OPERATOR TREES FOR MODELING RATING FUNCTIONS (Q3401067) (← links)
- Multi-Objective Combinatorial Optimization: Problematic and Context (Q3562815) (← links)
- ParamILS: An Automatic Algorithm Configuration Framework (Q3651487) (← links)
- The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm (Q5060081) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
- Evolutionary algorithms for single and multicriteria design optimization (Q5950265) (← links)
