机译:基于学习的变量分配加权方案,用于欧氏旅行商问题的启发式和精确搜索
Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University,Hunghom, Kowloon, Hong Kong;
Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University,Hunghom, Kowloon, Hong Kong;
Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University,Hunghom, Kowloon, Hong Kong;
Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University,Hunghom, Kowloon, Hong Kong;
supervised learning; metaheuristics; euclidean traveling salesman problem; class association rules; large-scale optimization;
机译:欧氏图中两周期平衡旅行商问题的启发式算法
机译:关于欧氏旅行商问题的有限和无限分形实例的启发式方法的性能
机译:最大后悔,贪婪和其他启发式方法对多维分配和旅行商问题的最坏情况分析
机译:欧氏旅行商问题的新组合启发式算法
机译:欧氏Steiner树问题的精确和启发式算法。
机译:方向感和责任感是欧几里德旅行推销员问题绩效的预测指标
机译:基于学习的变量分配加权方案,用于欧氏旅行商问题的启发式和精确搜索