Menu

Tackling discrete optimization problems by continuous methods

Published on 2021-07-0654 Views
video thumbnail
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Many NP-hard discrete and combinatorial optimization problems can be formulated with the help of quadratic expressions. These in turn can be linearized by lifting the problem from n-dimensional spac

RELATED CATEGORIES

MORE VIDEOS FROM THE EVENT

MORE VIDEOS FROM THE SAME CATEGORIES

Except where otherwise noted, content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 International license.