Abstract
We propose a stochastic algorithm for solving NP-hard combinatorial optimization problems and study its convergence
Anno
2005
Autori IAC
Tipo pubblicazione
Altri Autori
Sebastiani G., Torrisi G.L.
Editore
Kluwer Academic Publishers
Rivista
Methodology and computing in applied probability (Print)