Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
From MaRDI portal
Cited in
(12)- A review of message passing algorithms in estimation of distribution algorithms
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- Anytime Pareto local search
- A hybrid data mining GRASP with path-relinking
- A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
- The use of tail inequalities on the probable computational time of randomized search heuristics
- Extending time-to-target plots to multiple instances
- Fast fitness improvements in estimation of distribution algorithms using belief propagation
- Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
- The orienteering problem: a survey
- Scheduling multi-skill technicians and reassignable tasks in a cloud computing company
This page was built for publication: Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731477)