GECCO2021 - com103 - Competitions - Exact and Approximate USCP With Branch and Bound
About this video
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceCovers exact and approximate solutions to USCP using branch-and-bound, teaching algorithmic paradigms for constraint satisfaction and combinatorial search. GECCO competition talk explains solution techniques.
A 4-minute video from Association for Computing Machinery (ACM): “GECCO2021 - com103 - Competitions - Exact and Approximate USCP With Branch and Bound”.
Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.