Hybridizations of GRASP with path relinking for the far from most string problem - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Daniele Ferone, Paola Festa, Mauricio G. C. Resende. Hybridizations of GRASP with path relinking for the far from most string problem. ITOR, 23(3):481-506, 2016. [doi]

The following publications are possibly variants of this publication:

Hybridizations of GRASP with Path-RelinkingPaola Festa, Mauricio G. C. Resende. In El-Ghazali Talbi, editor, Hybrid Metaheuristics. Volume 434 of Studies in Computational Intelligence, pages 135-155, Springer, 2013. [doi]

Hybrid Metaheuristics for the Far From Most String ProblemDaniele Ferone, Paola Festa, Mauricio G. C. Resende. hm 2013: 174-188 [doi]

Efficient solutions for the far from most string problemPaola Festa, Panos M. Pardalos. anor, 196(1):663-682, 2012. [doi]

A Hybrid Ant Colony Optimization Algorithm for the Far From Most String ProblemChristian Blum, Paola Festa. evoW 2014: 1-12 [doi]

runs on WebDSL