The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

In metamodeling, the choice of sampling points is crucial for the quality of the model. In this context, the maximin Latin hypercube designs (LHD), with their space-filling and noncollapsing ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

In a combinatorial auction m heterogenous indivisible items are sold to n bidders. This paper considers settings in which the valuation functions of the bidders are known to be complement free (a.k.a.

Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...

June 5, 2024 — In a new paper in Science Advances on May 29, researchers at JPMorgan Chase, the U.S. Department of Energy’s (DOE) Argonne National Laboratory and Quantinuum have demonstrated clear ...