algorithms for np-hard problems (section 20.4: the 2-opt heuristic for the tsp) [part 1 of 2]
Published 4 years ago • 14K plays • Length 12:45Download video MP4
Download video MP3
Similar videos
-
11:58
algorithms for np-hard problems (section 20.4: the 2-opt heuristic for the tsp) [part 2/2]
-
20:10
algorithms for np-hard problems (section 20.2: a greedy heuristic for maximum coverage) [part 1/2]
-
23:12
algorithms for np-hard problems (section 20.5: principles of local search) [part 1 of 2]
-
19:35
algorithms for np-hard problems (section 21.1: the bellman-held-karp algorithm for tsp) [part 1/2]
-
17:19
algorithms for np-hard problems (section 24.3: feasibility checking) [pt 1/2]
-
21:44
algorithms for np-hard problems (section 20.2: a greedy heuristic for maximum coverage) [part 2/2]
-
19:09
algorithms for np-hard problems (section 20.3: a greedy heuristic for influence maximization) [1/2]
-
10:05
algorithms for np-hard problems (section 19.0: overview and prerequisites)
-
1:09:24
algorithmic game theory (lecture 1: introduction and examples)
-
1:25:25
16. complexity: p, np, np-completeness, reductions
-
59:45
polya explains the problem solving technique
-
22:03
algorithms for np-hard problems (section 24.2: greedy heuristics for buying back licenses) [pt 1/2]
-
26:07
algorithm for np-hard problems (section 19.5: a simple recipe for proving np-hardness)
-
19:18
algorithms for np-hard problems (section 20.1: makespan minimization) [part 1 of 2]
-
28:30
algorithms for np-hard problems (section 21.2: color coding) [part 1 of 2]
-
16:19
algorithms for np-hard problems (section 19.1: the algorithmic mystery of mst vs. tsp)
-
26:25
algorithms for np-hard problems (section 24.3: feasibility checking) [pt 2/2]
-
24:58
algorithms for np-hard problems (section 23.3: np: problems with easily recognized solutions)
-
12:32
algorithms for np-hard problems (section 22.6: the tsp is np-hard)
-
11:12
algorithms for np-hard problems (section 23.1: amassing evidence of intractability)
-
24:49
algorithms for np-hard problems (section 20.5: principles of local search) [part 2 of 2]