Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
From MaRDI portal
Publication:693145
DOI10.1007/S10898-011-9769-ZzbMATH Open1259.90115OpenAlexW2092220612MaRDI QIDQ693145FDOQ693145
Reinaldo Vallejos, Celso C. Ribeiro, Isabel Rosseti
Publication date: 7 December 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9769-z
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
- Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
- Algorithm 797
- Computing approximate solutions of the maximum covering problem with GRASP
- Routing and wavelength assignment by partition colouring
- A hybrid heuristic for the diameter constrained minimum spanning tree problem
- GRASP with path relinking for three-index assignment
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Slow annealing versus multiple fast annealing runs - an empirical investigation
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Greedy randomized adaptive search procedures
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Probability distribution of solution time in GRASP: an experimental investigation
- TTT plots: a perl program to create time-to-target plots
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- Applications of the DM‐GRASP heuristic: a survey
- The 2-path network problem
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- Title not available (Why is that?)
- A GRASP for graph planarization
- Parallel local search
- A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (14)
- Extending time‐to‐target plots to multiple instances
- Solving the traveling delivery person problem with limited computational time
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- Hybridizations of GRASP with path relinking for the far from most string problem
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Black-box Complexity of Parallel Search with Distributed Populations
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Large-scale parallelism for constraint-based local search: the costas array case study
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
Uses Software
This page was built for publication: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693145)
