Polynomial Optimisation
Cambridge University
Add to My Podcasts
Episodes
About
Reviews
Promote
Lift-and-project methods and relaxations for Knapsack
1 hour 42 minutes
Posted Jul 31, 2013 at 3:18 pm.
-11:00
0:00
1:42:00
Add to My Queue
Download
MP3
Share
episode
Share at current time
Show notes
Chlamtac, E (Ben-Gurion University)
Tuesday 30 July 2013,
Watch Video
Previous
The graph partitioning problem: quick and dirty vs strong and long.
Next
The unique games conjecture and polynomial optimization
← See all 53 episodes of Polynomial Optimisation