Neighborhood Portfolio Approach for Local Search Applied to Timetabling Problems

ISSN： 1570-1166

Source： Journal of Mathematical Modelling and Algorithms, Vol.5, Iss.1, 2006-04, pp. : 65-89

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

A graph edge colouring approach for school timetabling problems

By Badoni Rakesh P. Gupta D.K.

International Journal of Mathematics in Operational Research, Vol. 6, Iss. 1, 2014-11 ,pp. : 123-138

Inderscience Publishers

Access to resources Recommend Favorite

On the performance of Scatter Search for post-enrolment course timetabling problems

By Jaradat Ghaith Ayob Masri Ahmad Zulkifli

Journal of Combinatorial Optimization, Vol. 27, Iss. 3, 2014-04 ,pp. : 417-439

Springer Publishing Company

Access to resources Recommend Favorite

Modelling and Solving Employee Timetabling Problems

By Meisels A.

Annals of Mathematics and Artificial Intelligence, Vol. 39, Iss. 1-2, 2003-09 ,pp. : 41-59

Springer Publishing Company

Access to resources Recommend Favorite

The complexity of Boolean constraint satisfaction local search problems

By Chapdelaine Philippe

Annals of Mathematics and Artificial Intelligence, Vol. 43, Iss. 1, 2005-01 ,pp. : 51-63

Springer Publishing Company

Access to resources Recommend Favorite

Analysis of a Local Search Heuristic for Facility Location Problems

By Korupolu M.R. Plaxton C.G. Rajaraman R.

Journal of Algorithms, Vol. 37, Iss. 1, 2000-10 ,pp. : 146-188

Academic Press

Access to resources Recommend Favorite