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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Local Search and the General Assignment Problem

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Sidgwick Site, Faculty of Law, B16 Digital Marketing Helps for Online Businesses FW11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon

Other talks

The Importance of Teaching about Science and Religion in a Time of Global Uncertainty Necessary mechanisms for super AI and stopping hallucinations: The consistent reasoning paradox and the indeterminacy function Tea and Coffee Break Max Perutz Lecture - Title TBC External Seminar - Jenn Brophy TBC Title to be confirmed: ANUBIS
 

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