Optimal Placements of Flexible Objects: Part II: A Simulated Annealing Approach for the Bounded Case
暂无分享,去创建一个
Chak-Kuen Wong | Kwong-Sak Leung | Andreas Alexander Albrecht | K. C. Hui | S. K. Cheung | K. Leung | Chak-Kuen Wong | A. Albrecht | K. Hui
[1] Katta G. Murty,et al. Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..
[2] Carl Sechen,et al. Timing Driven Placement for Large Standard Cell Circuits , 1995, 32nd Design Automation Conference.
[3] Chak-Kuen Wong,et al. Optimal Placements of Flexible Objects: Part I: Analytical Results for the Unbounded Case , 1997, IEEE Trans. Computers.
[4] A. Sangiovanni-Vincentelli,et al. The TimberWolf placement and routing package , 1985, IEEE Journal of Solid-State Circuits.
[5] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[6] P. R. Pinnock,et al. The mechanical properties of solid polymers , 1966 .
[7] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[8] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[9] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..
[10] Michael Jünger,et al. Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuits , 1994, Math. Program..
[11] S. Vavasis. On approximation algorithms for concave quadratic programming , 1992 .
[12] Mark Jerrum,et al. Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..
[13] Emile H. L. Aarts,et al. Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.