Polynomial Time Algorithm and Its Heuristics to Find the Best Move of a Very Large-Scale Neighborhood Search Technique

Duy Huynh. Polynomial Time Algorithm and Its Heuristics to Find the Best Move of a Very Large-Scale Neighborhood Search Technique. In H. John Caulfield, Shu-Heng Chen, Heng-Da Cheng, Richard J. Duro, Vasant Honavar, Etienne E. Kerre, Mi Lu, Manuel Grana Romay, Timothy K. Shih, Dan Ventura, Paul P. Wang, Yuanyuan Yang, editors, Proceedings of the 6th Joint Conference on Information Science, March 8-13, 2002, Research Triangle Park, North Carolina, USA. pages 1416-1422, JCIS / Association for Intelligent Machinery, Inc., 2002.

Abstract

Abstract is missing.