Stochastic Local Search Algorithms for Graph Set T-colouring and Frequency Assignment

Author： Chiarandini Marco   Stützle Thomas  

Publisher： Springer Publishing Company

ISSN： 1383-7133

Source： Constraints, Vol.12, Iss.3, 2007-09, pp. : 371-403

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Stopping rules in k-adaptive global random search algorithms

By Zhigljavsky Anatoly   Hamilton Emily  

Journal of Global Optimization, Vol. 48, Iss. 1, 2010-09 ,pp. : 87-97

Springer Publishing Company

Access to resources Recommend Favorite

Stochastic Motion and the Level Set Method in Computer Vision: Stochastic Active Contours

By Juan Olivier   Keriven Renaud   Postelnicu Gheorghe  

International Journal of Computer Vision, Vol. 69, Iss. 1, 2006-08 ,pp. : 7-25

Springer Publishing Company

Access to resources Recommend Favorite

Generic Incremental Algorithms for Local Search

By Ågren Magnus   Flener Pierre   Pearson Justin  

Constraints, Vol. 12, Iss. 3, 2007-09 ,pp. : 293-324

Springer Publishing Company

Access to resources Recommend Favorite

Local Search Heuristics for Capacitated p-Median Problems

By Lorena Luiz Antonio Nogueira   Senne Edson Luiz França  

Networks and Spatial Economics, Vol. 3, Iss. 4, 2003-12 ,pp. : 407-419

Springer Publishing Company

Access to resources Recommend Favorite

Local search heuristics for the multidimensional assignment problem

By Karapetyan Daniel  

Journal of Heuristics, Vol. 17, Iss. 3, 2011-06 ,pp. : 201-249

Springer Publishing Company

Access to resources Recommend Favorite