Integer Programming Courses and Certifications

NDC Conferences

Building AI Solutions with Google OR-Tools

Learn to build AI solutions using Google OR-Tools for optimization problems. Explore constraint programming, linear programming, and mixed-integer programming through practical examples like Sudoku and scheduling.

• YouTube
• 1 hour 4 minutes
• Self-Paced
• Conference Talk

International Centre for Theoretical Sciences

Computational Complexity in Theory and in Practice by Richard M. Karp

Explore the contrast between theoretical and practical approaches to algorithm efficiency, covering complexity classes, NP-completeness, approximation algorithms, and real-world applications.

• YouTube
• 1 hour 17 minutes
• Self-Paced
• Free Video

The Julia Programming Language

The State of JuMP - Progress and Future Plans

Explore JuMP's progress, new features, and future plans for mathematical optimization in Julia. Learn about governance changes, NSF funding, and how to get involved in this powerful modeling language.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

Wolfram

The State of Optimization - Practical Problem Solving with Constraints

Explore practical problem-solving through constraint formulation and specialized optimization methods. Gain insights into advanced techniques for tackling complex challenges.

• YouTube
• 57 minutes
• Self-Paced
• Free Video

The Julia Programming Language

The State of JuMP - Progress and Developments in Julia Optimization

Explore recent advancements and developments in JuMP, the Julia-based mathematical optimization package, over the past year.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

International Centre for Theoretical Sciences

The Grothendieck Inequality by Gadadhar Misra

Explore the Grothendieck inequality, its consequences, and related concepts in mathematics. Learn about max cut problems, cut norms, and proofs, including Kirvine's approach to this fundamental inequality.

• YouTube
• 1 hour 8 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Fair and Interpretable Decision Rules for Binary Classification

Explore fair and interpretable decision rules for binary classification using Boolean rule sets in DNF, with a focus on maximizing accuracy while maintaining group fairness constraints.

• YouTube
• 31 minutes
• Self-Paced
• Free Video

Alan Turing Institute

Delayed Column Generation in Large Scale Integer Optimization Problems

Explore delayed column generation for solving large-scale mixed integer programming problems, focusing on applications in data science and decision mathematics.

• YouTube
• 2 hours 41 minutes
• Self-Paced
• Free Video

Simons Institute

Reinforcement Learning in Recommender Systems - Some Challenges

Explore challenges in applying reinforcement learning to recommender systems, including scale, stochastic action sets, and user learning over long horizons. Gain insights on addressing these issues.

• YouTube
• 52 minutes
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

On Circuit Imbalance Measures and Their Role in Circuit Augmentation Algorithms

Explore new combinatorial condition numbers for linear and integer programs, their relation to existing measures, and their impact on circuit diameter bounds and simplex methods.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

Dyalog User Meetings

TAMPA - Taming Mathematical Programming in APL

Explore mathematical programming in APL using TAMPA, a linear programming system. Learn optimization techniques through practical examples and a user-friendly interface built with Abacus.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

Harvard CMSA

Mind Your Ps and Qs: Allocation with Priorities and Quotas

Delve into allocation algorithms for distributing limited resources across multiple demographics using priorities and quotas, with applications in university admissions and medical supply rationing.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Institute for Advanced Study

Sharp Selector Processes and Their Applications in Optimization Theory

Delve into advanced stochastic processes, exploring Talagrand's selector process conjecture and its connections to combinatorics, optimization problems, and threshold phenomena in computer science.

• YouTube
• 2 hours 11 minutes
• Self-Paced
• Free Video

Centre International de Rencontres Mathématiques

Polyhedral Sets, Lattice Points, Optimizing Compilers and Computer Algebra - Lecture 1

Explore core algorithms of polyhedral geometry, covering rational polyhedra, lattice points, and applications in optimizing compilers. Learn both theoretical concepts and practical implementations.

• YouTube
• 1 hour 27 minutes
• Self-Paced
• Free Video

Centre International de Rencontres Mathématiques

Polyhedral Sets, Lattice Points, Optimizing Compilers and Computer Algebra - Lecture 2

Delve into core algorithms of polyhedral geometry, exploring rational polyhedra, lattice points, and quantifier elimination techniques used in optimizing compilers. Second lecture in a mathematical series.

• YouTube
• 1 hour 22 minutes
• Self-Paced
• Free Video