Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings

DOI10.1007/978-3-642-03751-1zbMath1172.68312OpenAlexW1621116184MaRDI QIDQ731477

No author found.

Publication date: 8 October 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03751-1

Mathematics Subject Classification ID

Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (11)

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 ⋮ OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms ⋮ The orienteering problem: a survey ⋮ Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks ⋮ 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 ⋮ 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

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