We propose a stochastic algorithm for solving NP-hard combinatorial optimization problems and study its convergence
An extended ant colony algorithm and its convergence analysis
Sebastiani G;Torrisi GL
2005
Abstract
We propose a stochastic algorithm for solving NP-hard combinatorial optimization problems and study its convergenceFile in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
