Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
type: Item
instance of: scholarly article
title: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
zbMATH Open document ID: 1259.90115
author: Isabel Rosseti
author: Reinaldo Vallejos
author: Celso C. Ribeiro
published in: Journal of Global Optimization
publication date: 2012-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6113934
zbMATH Keywords: GRASP
zbMATH Keywords: metaheuristics
zbMATH Keywords: stochastic local search
zbMATH Keywords: run time distributions
zbMATH Keywords: time-to-target plots
zbMATH Keywords: path-relinking
describes a project that uses: TTTPLOTS
describes a project that uses: Algorithm 797
describes a project that uses: Algorithm 787
describes a project that uses: PERL
describes a project that uses: GRASP_QAP
MaRDI profile type: Publication
full work available at URL: s10898-011-9769-z
OpenAlex ID: W2092220612
cites work: GRASP with path relinking for three-index assignment
cites work: Probability distribution of solution time in GRASP: an experimental investigation
cites work: TTT plots: a perl program to create time-to-target plots
cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs
cites work: The 2-path network problem
cites work: Slow annealing versus multiple fast annealing runs - an empirical investigation
cites work: Q4350078
cites work: Greedy randomized adaptive search procedures
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: Q4321558
cites work: A hybrid heuristic for the diameter constrained minimum spanning tree problem
cites work: Routing and wavelength assignment by partition colouring
cites work: A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks
cites work: Computing approximate solutions of the maximum covering problem with GRASP
cites work: Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP
cites work: Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP
cites work: Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
cites work: A GRASP for graph planarization
cites work: Algorithm 797
cites work: Q4813179
cites work: Applications of the DM‐GRASP heuristic: a survey
cites work: Parallel local search
DOI: 10.1007/S10898-011-9769-Z
description: scientific article; zbMATH DE number 6113934