Publication:4813179
From MaRDI portal
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
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Extending time‐to‐target plots to multiple instances, Probabilistic stopping rules for GRASP heuristics and extensions, Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms, GRASP with path-relinking for the generalized quadratic assignment problem, \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms, A biased random-key genetic algorithm for data clustering, Scatter search --- wellsprings and challenges, GRASP with path relinking heuristics for the antibandwidth problem