论文信息 - Heuristics for biquadratic assignment problems and their computational comparison - 字舞流文

Heuristics for biquadratic assignment problems and their computational comparison

R. Burkard | E. Çela

[1] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..

[2] David Connolly. An improved annealing scheme for the QAP , 1990 .

[3] Jadranka Skorin-Kapov,et al. Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..

[4] Miroslaw Malek,et al. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem , 1990 .

[5] T. L. Ward,et al. Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .

[6] Jean-Luc Lutton,et al. The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach , 1986 .

[7] Steven G. Louie,et al. A Monte carlo simulated annealing approach to optimization over continuous variables , 1984 .

[8] F. Rendl,et al. A thermodynamically motivated simulation procedure for combinatorial optimization problems , 1984 .

[9] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[10] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[11] Rainer E. Burkard,et al. On the Biquadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.