Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Combinatorial Optimization

Showing: 126 courses
HyperComplex Seminar

Solving Routing Problems Using Quantum and Hybrid Algorithms

0 rewiews
Explore quantum and hybrid algorithms for solving NP-hard routing problems, comparing them with classical solvers and discussing future research directions.
Add to list
1 Lesons
40 minutes
On-Demand
Free-Video
GERAD Research Center

Personalized Shift Scheduling Problems: From Modelling to Efficient Resolution

0 rewiews
Explore personalized shift scheduling challenges, modeling techniques, and efficient resolution methods for complex employee scheduling problems like nurse rostering.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
CIMPA UCR

Álgebras de Configuración de Brauer y sus Aplicaciones en Criptografía y Ciencias

0 rewiews
Explora las álgebras de configuración de Brauer, su origen y aplicaciones en criptografía, ecuaciones de Yang-Baxter, teoría de grafos y optimización combinatoria.
Add to list
1 Lesons
1 hour 2 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Algorithms for Rank-1 Bimatrix Games

0 rewiews
Explore algorithms for solving rank-1 bimatrix games efficiently, including polynomial-time methods for finding Nash equilibria and path-following techniques. Discusses complexity, uniqueness, and parameterized approaches.
Add to list
18 Lesons
32 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Beyond Value Iteration for Parity Games - Strategy Iteration with Universal Trees

0 rewiews
Explores strategy iteration framework for parity games using universal trees, aiming to overcome quasi-polynomial barriers and improve upon value iteration algorithms for efficient game solving.
Add to list
1 Lesons
28 minutes
On-Demand
Free-Video
VinAI

Chance Constrained Simultaneous Task Allocation and Path Planning for Multi-Robot Systems

0 rewiews
Explore multi-robot task allocation and path planning with probabilistic performance guarantees. Learn algorithmic approaches for optimizing team performance in open environments.
Add to list
1 Lesons
1 hour 28 minutes
On-Demand
Free-Video
Simons Institute

Spectral Aspects of Symmetric Matrix Signings

0 rewiews
Explore symmetric matrix signings, their spectral aspects, and applications in graph theory, polynomial identity testing, and algorithmic problems.
Add to list
11 Lesons
30 minutes
On-Demand
Free-Video
Simons Institute

Constructing Extended Formulations

0 rewiews
Explore advanced techniques for constructing extended formulations in combinatorial optimization, focusing on polytopes, matchings, cycles, and spanning trees in various graph types.
Add to list
24 Lesons
1 hour 7 minutes
On-Demand
Free-Video
Paul G. Allen School

Theory Seminar - Submodular Maximization

0 rewiews
Explore submodular maximization techniques, recent advances, and open questions in combinatorial optimization with Professor Niv Buchbinder's comprehensive theory seminar.
Add to list
28 Lesons
52 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Faster Energy Maximization for Faster Maximum Flow

0 rewiews
Explore advanced techniques for solving maximum flow problems in undirected graphs, focusing on energy maximization and weight reduction strategies to improve algorithmic efficiency.
Add to list
15 Lesons
21 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Deep Learning for Combinatorial Optimization - Count Your Flops & Make Your Flops Count

0 rewiews
Explores deep learning for combinatorial optimization, focusing on reducing computation through learned models while balancing solution quality. Discusses practical examples, challenges, and future research directions.
Add to list
6 Lesons
23 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

How Much Data Is Sufficient to Learn High-Performing Algorithms?

0 rewiews
Explore data-driven algorithm design's impact on performance, focusing on generalization guarantees for combinatorial algorithms with piecewise-structured parameter functions.
Add to list
17 Lesons
25 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

A Framework for Differentiable Discovery of Graph Algorithms

0 rewiews
Explore graph algorithm discovery using deep learning and tree decomposition. Learn effective techniques for NP-complete problems with interpretable results and expanded search space.
Add to list
19 Lesons
29 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Neural Network Verification as Piecewise Linear Optimization

0 rewiews
Neural network verification as piecewise linear optimization: exploring robust methods to prove model reliability against attacks, using LP and MIP formulations for efficient problem-solving in various network types.
Add to list
16 Lesons
26 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Neil Olver: On the Integrality Gap of the Prize Collecting Steiner Forest LP

0 rewiews
Explores the integrality gap of the prize collecting Steiner forest LP, disproving the belief it was 2 and showing it's at least 9/4, with implications for approximation algorithms in combinatorial optimization.
Add to list
9 Lesons
28 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Gomory Mixed Integer Cuts Are Optimal

0 rewiews
Explores the theoretical superiority of Gomory mixed-integer cuts in integer programming, demonstrating their optimality in maximizing volume cut-off from the nonnegative orthant in infinite group relaxations.
Add to list
10 Lesons
29 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Viswanath Nagarajan - Stochastic Load Balancing on Unrelated Machines

0 rewiews
Explores stochastic load balancing on unrelated machines, presenting a constant factor approximation algorithm for minimizing expected makespan. Discusses LP relaxation and rounding techniques.
Add to list
21 Lesons
32 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Finding Perfect Matchings in Bipartite Hypergraphs

0 rewiews
Explore efficient algorithms for finding perfect matchings in bipartite hypergraphs, extending Haxell's condition and the Hungarian algorithm to hypergraph structures.
Add to list
8 Lesons
29 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Louis Theran: Rigidity of Random Graphs in Higher Dimensions

0 rewiews
Explore rigidity properties of random graphs in higher dimensions and their connection to matrix completion, with insights on thresholds and optimal conditions.
Add to list
8 Lesons
32 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Recent Results on Maximizing Submodular Functions

0 rewiews
Explore recent advancements in submodular maximization, covering constrained and unconstrained scenarios for monotone and non-monotone functions within combinatorial optimization.
Add to list
21 Lesons
1 hour 6 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Provable Submodular Function Minimization via Fujishige Wolfe Algorithm

0 rewiews
Explore submodular function minimization through the Fujishige-Wolfe algorithm, analyzing its convergence and implications for combinatorial optimization.
Add to list
18 Lesons
25 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Maximizing Monotone Submodular Functions over the Integer Lattice

0 rewiews
Explore advanced algorithms for maximizing monotone submodular functions on integer lattices, with applications in machine learning and combinatorial optimization.
Add to list
13 Lesons
30 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Andreas E. Feldmann - A -embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs

0 rewiews
Explores embedding low highway dimension graphs into bounded treewidth graphs, with applications in transportation network optimization problems like Travelling Salesman and Facility Location.
Add to list
22 Lesons
27 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Ahmad Abdi- Packing Odd T-Joins With at Most Two Terminals

0 rewiews
Explore graph theory with Ahmad Abdi as he delves into packing odd T-joins, covering applications, proof strategies, and open questions in combinatorial optimization.
Add to list
17 Lesons
32 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Reassembling Trees for the Traveling Salesman

0 rewiews
Explore advanced approximation algorithms for traveling salesman problems, focusing on tree reassembly techniques to improve solutions beyond traditional methods.
Add to list
8 Lesons
31 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Zoltán Szigeti: On -2k,k--connected Graphs

0 rewiews
Exploration of (2k,k)-connected graphs, focusing on orientation and construction methods. Covers arc-connectivity, vertex-connectivity, and splitting-off techniques for various graph structures.
Add to list
15 Lesons
47 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

On LP-Relaxations for the Tree Augmentation Problem

0 rewiews
Explore LP-relaxations for tree augmentation, including dual-fitting algorithms, shadow-minimal solutions, and blocking trees. Gain insights into improved approximation techniques for combinatorial optimization problems.
Add to list
13 Lesons
33 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

On Element Connectivity Preserving Graph Simplification

0 rewiews
Explores element-connectivity in graph simplification, focusing on reduction techniques, algorithmic results, and applications in network design. Highlights open problems and submodularity properties for faster algorithms.
Add to list
26 Lesons
46 minutes
On-Demand
Free-Video
Simons Institute

The Short-Path Algorithm for Combinatorial Optimization

0 rewiews
Explore the Short-path Algorithm's applications in combinatorial optimization, focusing on quantum computation challenges and potential solutions.
Add to list
1 Lesons
49 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Decision-Focused Learning - Integrating Downstream Combinatorics in ML

0 rewiews
Explore the integration of machine learning and discrete optimization to enhance problem-solving in real-world scenarios, focusing on decision-focused learning and tailored solution strategies.
Add to list
1 Lesons
27 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Fast Semidefinite Programming for Differentiable Combinatorial Optimization

0 rewiews
Explore advanced techniques in semidefinite programming for combinatorial optimization, focusing on fast and differentiable methods presented by Carnegie Mellon expert Zico Kolter.
Add to list
1 Lesons
29 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Structured ML Training via Conditional Gradients

0 rewiews
Explore conditional gradient methods for structured optimization in machine learning, covering applications in traditional and deep learning, with a focus on incorporating polyhedral structures into solutions.
Add to list
1 Lesons
24 minutes
On-Demand
Free-Video
International Mathematical Union

Polyhedral Techniques in Combinatorial Optimization: Matchings and Tours

0 rewiews
Explore recent advancements in combinatorial optimization, focusing on matching and traveling salesman problems. Learn about polyhedral techniques and linear programming formulations for designing efficient algorithms.
Add to list
1 Lesons
42 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Noriyoshi Sukegawa- On the Diameter of Polyhedra and Related Topics

0 rewiews
Explore polyhedra diameter and its impact on simplex method complexity. Overview previous findings, recent results, and open questions in this mathematical field.
Add to list
1 Lesons
56 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Performance of Steepest Descent in 0/1 LPs

0 rewiews
Explores steepest descent in 0/1 LPs, proving polynomial-length paths and developing a new pivot rule for the Simplex method. Unifies circuit and edge steps, advancing understanding of combinatorial optimization.
Add to list
1 Lesons
25 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Approximation Algorithms for Hard Augmentation Problems - Lecture II

0 rewiews
Explore advanced approximation algorithms for network design, focusing on connectivity augmentation problems and recent developments in combinatorial optimization techniques.
Add to list
1 Lesons
1 hour 20 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Comparing Polyhedral Relaxations via Volume

0 rewiews
Explore polyhedral relaxations in combinatorial optimization through volume calculations, examining fixed-charge problems and trilinear monomials for practical spatial branch-and-bound implementation guidance.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Panorama of Mathematics - A Panoramic Tour Through Combinatorial Optimization

0 rewiews
Explore combinatorial optimization with Michel Goemans in this insightful lecture, covering new trends, results, and challenges in mathematical sciences.
Add to list
1 Lesons
59 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Extensions and Ramifications of Discrete Convexity Concepts

0 rewiews
Explore discrete convexity concepts, including L-convex and M-convex functions, their properties, and related notions in combinatorial optimization and discrete mathematics.
Add to list
1 Lesons
1 hour 3 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Non TDI Optimization with Supermodular Functions

0 rewiews
Explores supermodular covering theorem's applications in non-TDI graph optimization, including degree-constrained problems, connectivity augmentation, and extensions of disjoint arborescences theorem.
Add to list
1 Lesons
1 hour 6 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Combinatorial Polynomial Algorithms for Skew Bisubmodular Function Minimization

0 rewiews
Explores combinatorial polynomial algorithms for skew-bisubmodular function minimization, extending previous work on bisubmodular functions and introducing new concepts in graph theory and optimization.
Add to list
1 Lesons
30 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Linear Matroid Matching in the Oracle Model

0 rewiews
Explores linear matroid matching in the oracle model, replacing linear algebraic computation with repeated oracle-calls along alternating paths to solve challenging problems in connectivity, rigidity, and count matroids.
Add to list
1 Lesons
44 minutes
On-Demand
Free-Video
Simons Institute

Noncommutativity and Rounding Schemes for Combinatorial Optimization

0 rewiews
Explore noncommutativity and rounding schemes in combinatorial optimization, focusing on quantum optimization techniques and their applications in solving complex problems.
Add to list
1 Lesons
1 hour 27 minutes
On-Demand
Free-Video
Simons Institute

Graph Linear Algebra Part 1

0 rewiews
Explore fundamental concepts of graph linear algebra, focusing on matrices, spectral theory, and their applications in algorithmic graph theory and network analysis.
Add to list
1 Lesons
1 hour 3 minutes
On-Demand
Free-Video
Simons Institute

Minimum Isolating Cuts - A New Tool for Solving Minimum Cut Problems

0 rewiews
Explore a powerful new tool for solving minimum cut problems in combinatorial optimization, with applications to global, Steiner, and all-pairs min-cut algorithms.
Add to list
1 Lesons
41 minutes
On-Demand
Free-Video
Simons Institute

A Theory of Alternating Paths and Blossoms from the Perspective of Minimum Length - Part 2

0 rewiews
Explores advanced graph theory concepts, focusing on alternating paths and blossoms in minimum length perspective. Provides in-depth insights into algorithm design for maximum cardinality matching in general graphs.
Add to list
1 Lesons
57 minutes
On-Demand
Free-Video
Simons Institute

A Theory of Alternating Paths and Blossoms, from the Perspective of Minimum Length

0 rewiews
Explores the Micali-Vazirani algorithm for maximum cardinality matching in graphs, presenting new ideas and insights into its structure and efficiency through a novel theory of alternating paths and blossoms.
Add to list
1 Lesons
1 hour
On-Demand
Free-Video
Paul G. Allen School

An Algebraic Perspective on Perfect Graphs - Theory Seminar

0 rewiews
Explore the algebraic perspective on perfect graphs, connecting graph theory with polynomial algebra and sum of squares decomposition. Gain insights into sos-perfectness and its equivalence to graph perfectness.
Add to list
1 Lesons
42 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Formalising the Theory of Combinatorial Optimisation

0 rewiews
Explore formalisation of combinatorial optimisation theory in Isabelle/HOL, focusing on matching theory and its mathematical implications for computer science and applied mathematics.
Add to list
1 Lesons
35 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Log-Concave Polynomials, Lattice Point Counting, and Traveling Salesperson Problem

0 rewiews
Explore log-concave polynomials and their applications in bounds, probability, and optimization, including recent advancements in lattice point counting and the Traveling Salesperson Problem.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Polyhedral Techniques in Combinatorial Optimization - Matchings and Tours

0 rewiews
Explore recent advancements in combinatorial optimization, focusing on matching and traveling salesman problems. Learn about polyhedral techniques and linear programming formulations for designing efficient algorithms.
Add to list
1 Lesons
39 minutes
On-Demand
Free-Video
Paul G. Allen School

Information Complexity of Mixed-Integer Convex Optimization

0 rewiews
Explore information complexity in mixed-integer convex optimization, including oracle-based bounds and partial first-order information impacts, with insights from Professor Amitabh Basu.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
NCCR SwissMAP

Integrality Gaps for Vertex Covers on Sparse Bernoulli Hypergraphs

0 rewiews
Explore integrality gaps for vertex covers on sparse Bernoulli hypergraphs with insights from ETH Zurich researcher D. Dmitriev.
Add to list
1 Lesons
15 minutes
On-Demand
Free-Video
NPTEL-NOC IITM

Karger's Mincut Algorithm - Introduction and Implementation

0 rewiews
Explore Karger's mincut algorithm, its motivation, problem definition, and implementation through a practical example.
Add to list
5 Lesons
10 minutes
On-Demand
Free-Video
NPTEL-NOC IITM

State Space Search: Problem-Solving Approaches and Examples

0 rewiews
Explore problem-solving techniques through state space search, from simple puzzles to complex real-world scenarios.
Add to list
19 Lesons
42 minutes
On-Demand
Free-Video
Institut des Hautes Etudes Scientifiques (IHES)

Mathematical Foundation of Various MCMC Methods

0 rewiews
Explore advanced MCMC methods for combinatorial optimization, including multi-spin flip techniques. Compare mathematical and numerical results to evaluate efficiency in different contexts.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
Simons Institute

Sparsifying Set Systems for Coverage Problems

0 rewiews
Explore recent advancements in sparsifying set systems for coverage problems, focusing on sublinear graph simplification techniques.
Add to list
1 Lesons
35 minutes
On-Demand
Free-Video
Simons Institute

On (1 + ε)-Approximate (Vertex) Cut Sparsifiers

0 rewiews
Explore advanced graph compression techniques for planar and quasi-bipartite graphs, focusing on high-quality cut sparsifiers and their size bounds. Analyze contraction-based approaches and their limitations.
Add to list
1 Lesons
29 minutes
On-Demand
Free-Video
Simons Institute

Stochastic Minimum Vertex Cover with Few Queries: A 3/2-Approximation

0 rewiews
Explore a 3/2-approximation algorithm for stochastic vertex cover using O(n/p) non-adaptive queries, improving upon previous 2-approximation methods and discussing extensions to correlated edge realizations.
Add to list
1 Lesons
30 minutes
On-Demand
Free-Video
Simons Institute

Linear Sketching Hypergraph Sparsifiers

0 rewiews
Explore linear sketching techniques for hypergraph sparsification, examining upper and lower bounds, dynamic streaming algorithms, and novel methods like random fingerprinting for efficient cut preservation.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Simons Institute

Cut Sparsification and Succinct Representation of Submodular Hypergraphs

0 rewiews
Explore cut sparsification of hypergraphs, focusing on submodular functions. Learn about new bounds, polynomial bounds, and succinct representation techniques for various submodular function families.
Add to list
1 Lesons
37 minutes
On-Demand
Free-Video
BIMSA

Finite Hypergraph Families with Rich Extremal Turan Constructions via Mixing Patterns

0 rewiews
Explore finite hypergraph families and their extremal Turán constructions through mixing patterns. Gain insights into combinatorics and discrete structures from a renowned expert.
Add to list
1 Lesons
58 minutes
On-Demand
Free-Video
NCCR SwissMAP

Sampling from the SK Measure via Algorithmic Stochastic Localization

0 rewiews
Explore algorithmic stochastic localization for sampling from the SK measure in spin glass systems. Gain insights into advanced statistical physics techniques.
Add to list
1 Lesons
45 minutes
On-Demand
Free-Video
Data Science Conference

Clustering Players' Strategies for Generation of Non-Player Characters in Mythic Legends

0 rewiews
Discover how machine learning and clustering techniques streamline NPC development in gaming, focusing on army formations in Mythic Legends and practical solutions to complex distance function challenges.
Add to list
1 Lesons
29 minutes
On-Demand
Free-Video
Centre for Networked Intelligence, IISc

Random Separating Hyperplane Theorem and Learning Polytopes

0 rewiews
Delve into advanced mathematical concepts of hyperplane theorem, polytope learning, and optimization oracles with applications in machine learning's hidden variable problems.
Add to list
1 Lesons
1 hour 5 minutes
On-Demand
Free-Video
Centre for Networked Intelligence, IISc

Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits

0 rewiews
Delve into stochastic combinatorial semi-bandits with a focus on risk-controlled online decision making, exploring algorithms for optimal subset selection while maintaining variance constraints.
Add to list
27 Lesons
58 minutes
On-Demand
Free-Video
ACM SIGPLAN

Scalable Linear Invariant Generation with Farkas' Lemma

0 rewiews
Explore scalable linear invariant generation techniques using Farkas' Lemma, improving efficiency and accuracy for affine programs without compromising completeness.
Add to list
1 Lesons
18 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Approximation Algorithms for Hard Augmentation Problems - Lecture III

0 rewiews
Explore advanced network design techniques for increasing graph connectivity, focusing on recent approaches and advances in augmentation problems like Tree Augmentation and Connectivity Augmentation.
Add to list
9 Lesons
1 hour 18 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

The Power of Randomization - Distributed Submodular Maximization on Massive Datasets

0 rewiews
Explore distributed algorithms for submodular maximization in machine learning, focusing on a parallel approach that achieves constant factor approximation guarantees for large-scale problems.
Add to list
17 Lesons
32 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

An O(1)-Approximation for Minimum Spanning Tree Interdiction

0 rewiews
Explore an O(1)-approximation algorithm for minimum spanning tree interdiction, improving upon previous O(log(m)) solutions. Learn about network interdiction and its applications in infrastructure protection.
Add to list
23 Lesons
51 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Matthias Mnich - Time- and Space-Optimal Algorithms for the Many-Visits TSP

0 rewiews
Optimizing algorithms for the many-visits TSP problem, improving time and space complexity while maintaining logarithmic dependence on tour length. Discusses applications and compares with previous work.
Add to list
14 Lesons
28 minutes
On-Demand
Free-Video
Simons Institute

Unique Games and Expansion

0 rewiews
Explore algorithms for Unique Games on certifiable small-set expanders and graphs with certifiable global hypercontractivity, providing insights into the 2-2 Games hardness result.
Add to list
1 Lesons
45 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A

0 rewiews
Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.
Add to list
14 Lesons
40 minutes
On-Demand
Free-Video
Association for Computing Machinery (ACM)

Towards a Better Understanding of Randomized Greedy Matching

0 rewiews
Explores randomized greedy matching algorithms, introducing Modified Randomized Greedy (MRG) and analyzing its performance in various graph scenarios, including weighted and oblivious matching.
Add to list
19 Lesons
23 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Tropical Tensor Networks

0 rewiews
Unified tensor network approach for spin glasses using tropical algebra, enabling ground state energy computation, optimal configuration identification, and solution counting. Combines graphical models and quantum circuit simulation.
Add to list
15 Lesons
25 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization

0 rewiews
Explore a hybrid approach combining reinforcement learning and constraint programming for solving complex combinatorial optimization problems, with applications in various fields.
Add to list
19 Lesons
28 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Reasoning on Natural Inputs

0 rewiews
Explore neural algorithmic reasoning for natural inputs, bridging classical algorithms with deep learning to solve real-world problems more effectively in reinforcement learning environments.
Add to list
5 Lesons
27 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Can ML Help in Solving Cargo Capacity Management Booking Control Problems

0 rewiews
Explore ML applications in cargo capacity management, focusing on booking control problems and predicting solution costs for discrete optimization in revenue management.
Add to list
9 Lesons
27 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

The Transformer Network for the Traveling Salesman Problem

0 rewiews
Explore how Transformer networks can tackle the Traveling Salesman Problem, improving upon existing heuristics with promising results for combinatorial optimization challenges.
Add to list
6 Lesons
30 minutes
On-Demand
Free-Video
International Centre for Theoretical Sciences

Robust Regression by Purushottam Kar

0 rewiews
Explore robust regression techniques for learning and estimation in algorithms and optimization, focusing on practical applications and theoretical foundations.
Add to list
14 Lesons
47 minutes
On-Demand
Free-Video
International Mathematical Union

Constraint Satisfaction Problem - What Makes the Problem Easy

0 rewiews
Explore constraint satisfaction problems, their complexity, and variants. Learn about polynomial-time solvable cases and NP-complete instances in this mathematical deep dive.
Add to list
1 Lesons
43 minutes
On-Demand
Free-Video
Fields Institute

Quantum Optimization of Maximum Independent Set Using Rydberg Atom Arrays

0 rewiews
Explore quantum optimization techniques for solving the Maximum Independent Set problem using Rydberg atom arrays in this advanced physics lecture.
Add to list
1 Lesons
27 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Prediction + Optimisation - Without and With Decision-Focused Learning

0 rewiews
Explore AI-enhanced combinatorial optimization, including preference learning, decision-focused learning, and explanation generation. Discover CPMpy, a modern constraint programming language integrating multiple solving paradigms with machine learning.
Add to list
1 Lesons
58 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Restricted Boltzmann Machines for Maximum Satisfiability - IPAM at UCLA

0 rewiews
Explore how Restricted Boltzmann Machines can be applied to Maximum Satisfiability problems, leveraging neural network accelerators for efficient stochastic search in combinatorial optimization.
Add to list
1 Lesons
56 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

On Sparse Linear Programming and Simple Neural Networks

0 rewiews
Explores connections between sparse linear programming and neural networks, focusing on overparametrized learning and sparse inference from computational perspectives.
Add to list
1 Lesons
26 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Simple and Fast Rounding Algorithms for Directed and Node Weighted Multiway Cut

0 rewiews
Explore efficient algorithms for directed and node-weighted multiway cut problems, focusing on simple rounding techniques and integrality gap analysis in graph theory and combinatorial optimization.
Add to list
1 Lesons
27 minutes
On-Demand
Free-Video
Simons Institute

Embedding as a Tool for Algorithm Design

0 rewiews
Explore embedding algorithms for structured data prediction, combinatorial optimization, and dynamic network processes. Learn innovative approaches to algorithm design using latent variable models and mean field techniques.
Add to list
20 Lesons
1 hour 8 minutes
On-Demand
Free-Video
Simons Institute

Berkeley in the 80s - Richard Karp and the Theory of Computing

0 rewiews
In-depth interview with Turing Laureate Richard Karp, exploring his groundbreaking research on computational theory at Berkeley in the 1980s and its lasting impact on computer science.
Add to list
1 Lesons
1 hour 24 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Beating the Integrality Ratio for S-T-Tours in Graphs

0 rewiews
Explores a novel algorithm for the s-t-path graph TSP, achieving a 1.497 approximation ratio and surpassing the known integrality ratio of 3/2 through innovative techniques.
Add to list
1 Lesons
1 hour 1 minute
On-Demand
Free-Video
Hausdorff Center for Mathematics

A 1.5-Approximation for Path TSP

0 rewiews
Explores a 1.5-approximation algorithm for the Metric Path Traveling Salesman Problem, introducing novel techniques to handle larger s-t cuts and achieve a simplified approach matching Christofides' TSP algorithm.
Add to list
1 Lesons
1 hour 16 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Approximation Algorithms for Hard Augmentation Problems

0 rewiews
Explore advanced network design techniques for increasing graph connectivity, focusing on augmentation problems and recent developments in combinatorial optimization.
Add to list
1 Lesons
1 hour 12 minutes
On-Demand
Free-Video
Paul G. Allen School

Money, Circuits, Mythic Figures, and More - Theory in the Allen School

0 rewiews
Diverse theoretical computer science research: algorithms, data structures, complexity, combinatorics, and economics. Insights from UW Allen School's theory group on cutting-edge topics.
Add to list
19 Lesons
53 minutes
On-Demand
Free-Video
IEEE

Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization

0 rewiews
Explore advanced techniques for solving stochastic minimum norm combinatorial optimization problems, focusing on approximation algorithms and their applications in complex decision-making scenarios.
Add to list
1 Lesons
22 minutes
On-Demand
Free-Video
Institute for Pure & Applied Mathematics (IPAM)

Do Quantum Computers Have Applications in Machine Learning and Combinatorial Optimization

0 rewiews
Explores quantum computing's potential in machine learning and optimization, discussing recent developments, comparative power, limitations, and future prospects in these fields.
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
Simons Institute

Continuous-Time Quantum Walks for MAX-CUT Optimization

0 rewiews
Explore quantum walks for MAX-CUT optimization, linking Hamiltonians to thermalization. Discover novel insights into unitary dynamics for combinatorial problems using multi-stage walks and Floquet systems.
Add to list
1 Lesons
40 minutes
On-Demand
Free-Video
Simons Institute

The Virtues of the Quantum Approximate Optimization Algorithm

0 rewiews
Exploring QAOA's potential for solving combinatorial optimization problems, its performance guarantees, quantum supremacy, and practical limitations in near-term quantum computing.
Add to list
1 Lesons
52 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

N-Queens Problem Using Backtracking - Design and Analysis of Algorithms

0 rewiews
Learn to solve the N-Queens problem using backtracking, focusing on the 4-Queens case. Explore algorithmic techniques for efficient placement of queens on a chessboard without conflicts.
Add to list
1 Lesons
27 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

0/1 Knapsack Problem Using FIFO Branch and Bound - Design and Analysis of Algorithms

0 rewiews
Comprehensive tutorial on solving the 0/1 Knapsack problem using FIFO Branch and Bound method, with practical examples and step-by-step explanations for efficient algorithm implementation.
Add to list
1 Lesons
29 minutes
On-Demand
Free-Video
Hausdorff Center for Mathematics

Extension Complexity of Random Polytopes

0 rewiews
Explores extension complexity of random polytopes, discussing results for fixed-dimension convex hulls of random points on unit sphere or ball. Joint work with Kwan and Zhao.
Add to list
1 Lesons
46 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

0/1 Knapsack Problem Using Least Cost Branch and Bound - Design and Analysis of Algorithms

0 rewiews
Learn to solve the 0/1 Knapsack problem using Least Cost Branch and Bound method, with a step-by-step example demonstrating the algorithm's application in Design and Analysis of Algorithms.
Add to list
1 Lesons
23 minutes
On-Demand
Free-Video