Applying an Extended Guided Local Search to the Quadratic Assignment Problem
暂无分享,去创建一个
[1] Panos M. Pardalos,et al. The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.
[2] Christos Voudouris. Solving the Radio Link Frequency Assignment Problem using Guided Local Search , 2001 .
[3] Bjarne Stroustrup,et al. C++ Programming Language , 1986, IEEE Softw..
[4] Heekuck Oh,et al. Neural Networks for Pattern Recognition , 1993, Adv. Comput..
[5] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[6] Edward P. K. Tsang,et al. Guided Local Search for Solving SAT and Weighted MAX-SAT Problems , 2000, Journal of Automated Reasoning.
[7] É. Taillard. COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .
[8] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[9] T. L. Ward,et al. Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .
[10] Edward P. K. Tsang,et al. Fast local search and guided local search and their application to British Telecom's workforce scheduling problem , 1997, Oper. Res. Lett..
[11] Franz Rendl,et al. QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..
[12] Charles Fleurent,et al. Genetic Hybrids for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.
[13] Edward Tsang,et al. A Generic Neural Network Approach For Constraint Satisfaction Problems , 1992 .
[14] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[15] F. Aida,et al. Max{min Ant System for Quadratic Assignemnt Problems Max{min Ant System for Quadratic Assignment Problems , 1997 .
[16] Shara Amin. Simulated Jumping , 1999, Ann. Oper. Res..
[17] É. Taillard,et al. Adaptive memories for the Quadratic Assignment Problems , 1997 .
[18] C. Voudouris,et al. Guided Local Search — an Illustrative Example in Function Optimisation , 1998 .
[19] Patrick Prosser,et al. Guided Local Search for the Vehicle Routing Problem , 1997 .
[20] Edward P. K. Tsang,et al. Guided local search and its application to the traveling salesman problem , 1999, Eur. J. Oper. Res..
[21] Andrew J. Davenport,et al. GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.
[22] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..
[23] K. E.P.,et al. SOLVING THE RADIO LINK FREQUENCY ASSIGNMENT PROBLEM WITH THE GUIDED GENETIC ALGORITHM , 1998 .
[24] Edward P. K. Tsang,et al. Solving the Processor Configuration Problems with a Mutation-Based Genetic Algorithm , 1997, Int. J. Artif. Intell. Tools.
[25] Edward P. K. Tsang,et al. Applying a mutation-based genetic algorithm to processor configuration problems , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.
[26] Edward P. K. Tsang,et al. The guided genetic algorithm and its application to the generalized assignment problem , 1998, Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294).
[27] Edward P. K. Tsang,et al. Solving large processor configuration problems with the guided genetic algorithm , 1998, Proceedings Tenth IEEE International Conference on Tools with Artificial Intelligence (Cat. No.98CH36294).
[28] Edward P. K. Tsang,et al. Guided Genetic Algorithm and its Application to Radio Link Frequency Assignment Problems , 2001, Constraints.
[29] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.