\texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
DOI10.1007/S11590-014-0760-8zbMATH Open1322.68259OpenAlexW1996201120MaRDI QIDQ2018872FDOQ2018872
Authors: Celso C. Ribeiro, Isabel Rosseti 
Publication date: 25 March 2015
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-014-0760-8
Recommendations
- TTT plots: a perl program to create time-to-target plots
- A simple expected running time analysis for randomized ``divide and conquer algorithms
- The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- scientific article; zbMATH DE number 5182609
metaheuristicsrandomized algorithmsstochastic local searchGRASPruntime distributionsalgorithm performancecomparison of two algorithmstttplots
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- Routing and wavelength assignment by partition colouring
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Probability distribution of solution time in GRASP: an experimental investigation
- TTT plots: a perl program to create time-to-target plots
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
- GRASP with path relinking heuristics for the antibandwidth problem
- A hybrid data mining GRASP with path-relinking
- Title not available (Why is that?)
Cited In (8)
- Solving the traveling delivery person problem with limited computational time
- A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- Extending time-to-target plots to multiple instances
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Tttplots-compare
- TTT plots: a perl program to create time-to-target plots
Uses Software
This page was built for publication: \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018872)
