scientific article
From MaRDI portal
Publication:3500152
zbMath1173.90587MaRDI QIDQ3500152
Mauro Birattari, Marco Dorigo, Prasanna Balaprakash
Publication date: 3 June 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (8)
Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling ⋮ Local search for constrained graph clustering in biological networks ⋮ Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem ⋮ On the finite-time dynamics of ant colony optimization ⋮ Recent trends in metaheuristics for stochastic combinatorial optimization ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem ⋮ Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
This page was built for publication:
