Toshiba's Optimization Algorithm Sets Speed Record for Solving Combinatorial Problems

Enjoy...

'Toshiba’s Optimization Algorithm Sets Speed Record for Solving Combinatorial Problems - IEEE Spectrum'

Copy and paste URL less single quotes...

2 Likes

Very cool.

I did a lot of mucking around with Simulated Annealing and the Metropolis algorithm while in uni. Using it for tasks like fitting various sized files onto minimum numbers of floppy disks, finding optimum solutions for student + classroom + teacher timetables for schools etc.

But given the money to be made in the financial realm, I can't see these algorithms making it to the public domain any time soon.

1 Like

As I understand it, is this a new approach to Dijkstra's sophisticated algorithm?