scientific article; zbMATH DE number 2090689
From MaRDI portal
Publication:4813179
zbMath1068.68707MaRDI QIDQ4813179
Isabel Rosseti, Celso Carneiro Ribeiro
Publication date: 12 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2400/24000922.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A biased random-key genetic algorithm for data clustering ⋮ Extending time‐to‐target plots to multiple instances ⋮ Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms ⋮ Probabilistic stopping rules for GRASP heuristics and extensions ⋮ \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms ⋮ GRASP with path-relinking for the generalized quadratic assignment problem ⋮ GRASP with path relinking heuristics for the antibandwidth problem ⋮ Scatter search --- wellsprings and challenges
