The following pages link to SPOT (Q18474):
Displaying 50 items.
- (Q97650) (redirect page) (← links)
- SPOTMisc (Q97663) (← links)
- babsim.hospital (Q106754) (← links)
- Fleet design optimisation from historical data using constraint programming and large neighbourhood search (Q265693) (← links)
- Balancing bike sharing systems with constraint programming (Q272022) (← links)
- Capacity consumption analysis using heuristic solution method for under construction railway routes (Q291652) (← links)
- A scatter search algorithm for the distributed permutation flowshop scheduling problem (Q297245) (← links)
- Algorithms for the workflow satisfiability problem engineered for counting constraints (Q328681) (← links)
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools (Q337131) (← links)
- A decision support tool for generating shipping data for the Hunter Valley coal chain (Q337259) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Improving the anytime behavior of two-phase local search (Q408982) (← links)
- Algorithm portfolio selection as a bandit problem with unbounded losses (Q408989) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation (Q508802) (← links)
- Time-series event-based prediction: an unsupervised learning framework based on genetic programming (Q528734) (← links)
- A new dispatching rule based genetic algorithm for the multi-objective job shop problem (Q604936) (← links)
- Evolutionary self-adaptation: a survey of operators and strategy parameters (Q613015) (← links)
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems (Q632658) (← 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)
- Emergence, analysis and evolution of structures. Concepts and strategies across disciplines (Q839314) (← links)
- Region based memetic algorithm for real-parameter optimisation (Q903616) (← links)
- How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing (Q935029) (← links)
- Tuning metaheuristics. A machine learning Perspective (Q1012715) (← links)
- Robust optimization - a comprehensive survey (Q1033240) (← links)
- 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 (Q1044246) (← 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)
- Matheuristics for the single-path design-balanced service network design problem (Q1652031) (← links)
- An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
- Evolutionary robust optimization in production planning -- interactions between number of objectives, sample size and choice of robustness measure (Q1652171) (← links)
- Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows (Q1652188) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- Large-scale vehicle routing problems: quantum annealing, tunings and results (Q1652398) (← links)
- Tabu search and iterated local search for the cyclic bottleneck assignment problem (Q1652664) (← 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 survey of the standard location-routing problem (Q1698292) (← links)
- A large set of torus obstructions and how they were discovered (Q1700776) (← links)
- A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem (Q1711458) (← links)
- A matheuristic for the driver scheduling problem with staff cars (Q1711474) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- On the estimation of Pareto fronts from the point of view of copula theory (Q1750061) (← links)
- Heuristics for periodical batch job scheduling in a MapReduce computing framework (Q1750408) (← links)
- A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints (Q1754303) (← links)
- A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization (Q1937953) (← links)
- Microforecasting methods for fresh food supply chain management: a computational study (Q1997065) (← links)
- A model of anytime algorithm performance for bi-objective optimization (Q2022237) (← links)
