University of Cambridge > > Churchill CompSci Talks > Local Search and the General Assignment Problem

Local Search and the General Assignment Problem

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Jasper Lee.

What can one do when faced with an NP-hard optimisation problem? We will examine local search algorithms and their potential to approximate difficult tasks, where the best known exact algorithm has exponential time complexity. In particular, I will show how we can apply local search to give approximate solutions with bounded error to the General Assignment Problem (GAP) in polynomial time.

This talk is part of the Churchill CompSci Talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity