On the best search strategy in parallel branch-and-bound:Best-First Search versus Lazy Depth-First Search

By Clausen J.   Perregaard M.  

Annals of Operations Research, Vol. 90, Iss. 1, 1999-01 ,pp. : 1-17

Springer Publishing Company

Access to resources Recommend Favorite

Depth-first heuristic search for the job shop scheduling problem

By Mencía Carlos  

Annals of Operations Research, Vol. 206, Iss. 1, 2013-07 ,pp. : 265-296

Springer Publishing Company

Access to resources Recommend Favorite

An investigation into dynamic yard crane deployment and comparisons between hill-climbing and best-first-search algorithms

By Yan Wei   Huang Youfang   He Junliang  

International Journal of Computer Applications in Technology, Vol. 32, Iss. 4, 2008-11 ,pp. : 254-264

Inderscience Publishers

Access to resources Recommend Favorite

Evaluating Six Candidate Solutions for the Small-Disjunct Problem and Choosing the Best Solution via Meta-Learning

By Carvalho Deborah  

Artificial Intelligence Review, Vol. 24, Iss. 1, 2005-09 ,pp. : 61-98

Springer Publishing Company

Access to resources Recommend Favorite

Modelling the machine loading problem of FMSs and its solution using a tabu-search-based heuristic

By Sarma U. M. B. S.   Kant Suman   Rai Rahul   Tiwari M. K.  

International Journal of Computer Integrated Manufacturing, Vol. 15, Iss. 4, 2002-07 ,pp. : 285-295

Taylor & Francis Ltd

Access to resources Recommend Favorite