\texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
type: Item
instance of: scholarly article
title: \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
zbMATH Open document ID: 1322.68259
author: Celso C. Ribeiro
author: Isabel Rosseti
published in: Optimization Letters
publication date: 2015-03-25T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90-04
zbMATH DE Number: 6419590
zbMATH Keywords: randomized algorithms
zbMATH Keywords: GRASP
zbMATH Keywords: tttplots
zbMATH Keywords: metaheuristics
zbMATH Keywords: stochastic local search
zbMATH Keywords: runtime distributions
zbMATH Keywords: algorithm performance
zbMATH Keywords: comparison of two algorithms
describes a project that uses: PERL
describes a project that uses: TTTPLOTS
MaRDI profile type: Publication
full work available at URL: s11590-014-0760-8
OpenAlex ID: W1996201120
cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
cites work: Q4813179
cites work: TTT plots: a perl program to create time-to-target plots
cites work: Probability distribution of solution time in GRASP: an experimental investigation
cites work: Q731477
cites work: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
cites work: Routing and wavelength assignment by partition colouring
cites work: A hybrid data mining GRASP with path-relinking
cites work: GRASP with path relinking heuristics for the antibandwidth problem
cites work: A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
DOI: 10.1007/S11590-014-0760-8
Recommended article: TTT plots: a perl program to create time-to-target plots
Recommended article: A simple expected running time analysis for randomized ``divide and conquer'' algorithms
Recommended article: The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
Recommended article: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
Recommended article: Q5757092
description: scientific article; zbMATH DE number 6419590