Mathematics of Operations Research, Vol. 25, No. 3 (Aug., 2000), pp. 476-484 (9 pages) Simulated Annealing has proven to be a very successful heuristic for various combinatorial optimization problems.
If you want to simulate a tic-tac-toe game, that’s easy. You can evaluate every possible move in a reasonable amount of time. Simulating antennas, however, is much harder. [Rosrislav] has been ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback