Machine Learning for Subproblem Selection
暂无分享,去创建一个
[1] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[2] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.
[3] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[4] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[5] P. Healy,et al. A new extension of local search applied to the Dial-A-Ride Problem , 1995 .
[6] Wei Zhang,et al. A Reinforcement Learning Approach to job-shop Scheduling , 1995, IJCAI.
[7] Andrew W. Moore,et al. Learning Evaluation Functions for Global Optimization and Boolean Satisfiability , 1998, AAAI/IAAI.
[8] Richard S. Sutton,et al. Learning Instance-Independent Value Functions to Enhance Local Search , 1998, NIPS.
[9] A. Barto,et al. Learned Subproblem Selection Techniques for Combinatorial Optimization , 1999 .