47:00A Linear Programming Problem, Fundamental Theorem of Linear Programming. UVic Math 151
A 47-minute video from Jonathan Noel: “A Linear Programming Problem, Fundamental Theorem of Linear Programming. UVic Math 151”.
Jonathan Noel
1.29K subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
47:00
41:39Absorbing Markov Chains (continued). UVic Math 151
A 42-minute video from Jonathan Noel: “Absorbing Markov Chains (continued). UVic Math 151”.
48:22Absorbing Markov Chains. UVic Math 151
A 48-minute video from Jonathan Noel: “Absorbing Markov Chains. UVic Math 151”.
49:23Arithmetic Operations on Matrices (continued). UVic Math 151
A 49-minute video from Jonathan Noel: “Arithmetic Operations on Matrices (continued). UVic Math 151”.
49:02Arithmetic Operations on Matrices. UVic Math 151
A 49-minute video from Jonathan Noel: “Arithmetic Operations on Matrices. UVic Math 151”.
46:50Assignment of Probabilities (continued), Calculating Probabilities. UVic Math 151
A 47-minute video from Jonathan Noel: “Assignment of Probabilities (continued), Calculating Probabilities. UVic Math 151”.
40:00Baye's Theorem. UVic Math 151
A 40-minute video from Jonathan Noel: “Baye's Theorem. UVic Math 151”.
47:52Binomial Trials. UVic Math 151
A 48-minute video from Jonathan Noel: “Binomial Trials. UVic Math 151”.
49:48Calculating Probabilities (continued), Conditional Probability and Independence. UVic Math 151
A 50-minute video from Jonathan Noel: “Calculating Probabilities (continued), Conditional Probability and Independence. UVic Math 151”.
49:47Conditional Probability and Independence (continued). UVic Math 151
A 50-minute video from Jonathan Noel: “Conditional Probability and Independence (continued). UVic Math 151”.
1:13:39Discrete Optimization 22: Matroid Intersection Theorem and Algorithm
A 74-minute video from Jonathan Noel: “Discrete Optimization 22: Matroid Intersection Theorem and Algorithm”.
1:19:27Discrete Optimization Lecture 10: Matching Polytope and Network Flows
A 79-minute video from Jonathan Noel: “Discrete Optimization Lecture 10: Matching Polytope and Network Flows”.
1:20:55Discrete Optimization Lecture 11: Max-Flow and Ford–Fulkerson Algorithm
A 81-minute video from Jonathan Noel: “Discrete Optimization Lecture 11: Max-Flow and Ford–Fulkerson Algorithm”.
1:20:45Discrete Optimization Lecture 12: Graph Colouring, Perfect Graphs and the Stable Set Polytope
A 81-minute video from Jonathan Noel: “Discrete Optimization Lecture 12: Graph Colouring, Perfect Graphs and the Stable Set Polytope”.
1:10:34Discrete Optimization Lecture 13: Edge Colouring
A 71-minute video from Jonathan Noel: “Discrete Optimization Lecture 13: Edge Colouring”.
1:14:50Discrete Optimization Lecture 14: List Colouring
A 75-minute video from Jonathan Noel: “Discrete Optimization Lecture 14: List Colouring”.
1:18:35Discrete Optimization Lecture 15: Dynamic Programming
A 79-minute video from Jonathan Noel: “Discrete Optimization Lecture 15: Dynamic Programming”.
1:13:46Discrete Optimization Lecture 16: Integer Linear Programs and Totally Unimodular Matrices
A 74-minute video from Jonathan Noel: “Discrete Optimization Lecture 16: Integer Linear Programs and Totally Unimodular Matrices”.
1:20:35Discrete Optimization Lecture 17: Semidefinite Programming
A 81-minute video from Jonathan Noel: “Discrete Optimization Lecture 17: Semidefinite Programming”.
1:08:31Discrete Optimization Lecture 18: MAXCUT Approximation Algorithm via SDP
A 69-minute video from Jonathan Noel: “Discrete Optimization Lecture 18: MAXCUT Approximation Algorithm via SDP”.
1:17:05Discrete Optimization Lecture 19: Introduction to Matroids and Greedy Algorithms
A 77-minute video from Jonathan Noel: “Discrete Optimization Lecture 19: Introduction to Matroids and Greedy Algorithms”.
1:11:06Discrete Optimization Lecture 1: Introduction, algorithms, Big O, Shortest Path
A 71-minute video from Jonathan Noel: “Discrete Optimization Lecture 1: Introduction, algorithms, Big O, Shortest Path”.
1:15:23Discrete Optimization Lecture 20: Matroid Duals, Restriction, Contraction and Equivalent Axioms
A 75-minute video from Jonathan Noel: “Discrete Optimization Lecture 20: Matroid Duals, Restriction, Contraction and Equivalent Axioms”.
22:07Discrete Optimization Lecture 21: Introduction to Matroid Intersection
A 22-minute video from Jonathan Noel: “Discrete Optimization Lecture 21: Introduction to Matroid Intersection”.
1:04:12Discrete Optimization Lecture 23: Grover's Algorithm
A 64-minute video from Jonathan Noel: “Discrete Optimization Lecture 23: Grover's Algorithm”.
1:05:52Discrete Optimization Lecture 2: Decision Problems, Complexity classes. Philosophy of Duality
A 66-minute video from Jonathan Noel: “Discrete Optimization Lecture 2: Decision Problems, Complexity classes. Philosophy of Duality”.
1:18:50Discrete Optimization Lecture 3: Reductions, hardness, NP-completeness, SAT, 3-SAT, undecidability
A 79-minute video from Jonathan Noel: “Discrete Optimization Lecture 3: Reductions, hardness, NP-completeness, SAT, 3-SAT, undecidability”.
1:18:00Discrete Optimization Lecture 4: Introduction to Linear Programming
A 78-minute video from Jonathan Noel: “Discrete Optimization Lecture 4: Introduction to Linear Programming”.
1:09:48Discrete Optimization Lecture 5: Linear Programming Basics and Weak Duality
A 70-minute video from Jonathan Noel: “Discrete Optimization Lecture 5: Linear Programming Basics and Weak Duality”.
1:12:46Discrete Optimization Lecture 6: Strong Duality for Linear Programming
A 73-minute video from Jonathan Noel: “Discrete Optimization Lecture 6: Strong Duality for Linear Programming”.
1:15:31Discrete Optimization Lecture 7: Introduction to Matchings, Kőnig's Theorem
A 76-minute video from Jonathan Noel: “Discrete Optimization Lecture 7: Introduction to Matchings, Kőnig's Theorem”.
1:18:37Discrete Optimization Lecture 8: Weighted Matching and Perfect Matching Problems in Bipartite Graphs
A 79-minute video from Jonathan Noel: “Discrete Optimization Lecture 8: Weighted Matching and Perfect Matching Problems in Bipartite Graphs”.
1:18:10Discrete Optimization Lecture 9: Stable Marriage Problem and Tutte–Berge Formula
A 78-minute video from Jonathan Noel: “Discrete Optimization Lecture 9: Stable Marriage Problem and Tutte–Berge Formula”.
48:35Fundamental Theorem of Linear Programming (continued), Linear Programming. UVic Math 151
A 49-minute video from Jonathan Noel: “Fundamental Theorem of Linear Programming (continued), Linear Programming. UVic Math 151”.
44:55Introduction to Markov Chains (continued). UVic Math 151
A 45-minute video from Jonathan Noel: “Introduction to Markov Chains (continued). UVic Math 151”.
46:37Introduction to Markov Chains. UVic Math 151
A 47-minute video from Jonathan Noel: “Introduction to Markov Chains. UVic Math 151”.