Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1309808
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Celso Carneiro Ribeiro / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TTTPLOTS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 797 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 787 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PERL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GRASP_QAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-011-9769-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092220612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with Path Relinking for Three-Index Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability distribution of solution time in GRASP: an experimental investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: TTT plots: a perl program to create time-to-target plots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with perturbations for the prize-collecting Steiner tree problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-path network problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slow annealing versus multiple fast annealing runs - an empirical investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the diameter constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and wavelength assignment by partition colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing approximate solutions of the maximum covering problem with GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the DM‐GRASP heuristic: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel local search / rank
 
Normal rank

Latest revision as of 23:55, 5 July 2024

scientific article
Language Label Description Also known as
English
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
scientific article

    Statements

    Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (English)
    0 references
    0 references
    0 references
    0 references
    7 December 2012
    0 references
    0 references
    GRASP
    0 references
    metaheuristics
    0 references
    stochastic local search
    0 references
    run time distributions
    0 references
    time-to-target plots
    0 references
    path-relinking
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references