A deterministic annealing algorithm for a combinatorial optimization problem using replicator equations
暂无分享,去创建一个
[1] Carsten Peterson,et al. A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..
[2] Shin Ishii,et al. -Opt Neural Approaches to Quadratic Assignment Problems , 2000, Neural Computation.
[3] Eric Mjolsness,et al. A Novel Optimizing Network Architecture with Applications , 1996, Neural Computation.
[4] Franz Rendl,et al. QAPLIB – A Quadratic Assignment Problem Library , 1997, J. Glob. Optim..
[5] Kazuo Tsuchiya,et al. A Markov Chain Monte Carlo Algorithm for the Quadratic Assignment Problem Based on Replicator Equations , 2001, ICANN.
[6] Shin Ishii,et al. Constrained neural approaches to quadratic assignment problems , 1998, Neural Networks.
[7] H. Haken,et al. Treatment of combinatorial optimization problems using selection equations with cost terms. Part II. NP -hard three-dimensional assignment problems , 1999 .
[8] Panos M. Pardalos,et al. The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.
[9] P. Holmes,et al. Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields , 1983, Applied Mathematical Sciences.
[10] Wesley E. Snyder,et al. Optimization by Mean Field Annealing , 1988, NIPS.
[11] Carsten Peterson,et al. Neural Networks and NP-complete Optimization Problems; A Performance Study on the Graph Bisection Problem , 1988, Complex Syst..