This paper presents a hybrid simulated annealing (SA) and column generation (CG) algorithm for the path-based formulation of the capacitated multicommodity network design (PCMND) problem. In the ...

Dr. James McCaffrey of Microsoft Research shows how to implement simulated annealing for the Traveling Salesman Problem (find the best ordering of a set of discrete items). The goal of a combinatorial ...

Dr. James McCaffrey of Microsoft Research explains a new idea that slightly modifies standard simulated annealing by borrowing ideas from quantum mechanics. The goal of a combinatorial optimization ...

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 ...

The "knapsack problem" is a widespread computing challenge—and no, it doesn't have to do just with literal backpacks. golubovy / iStock Imagine you’re a thief robbing a museum exhibit of tantalizing ...