OpenSourc.ES
Home
About me
julia-basics
Graphs.jl: The Myers difference algorithm
Matrix multiplication: Performance
Benchmarking and Profiling Julia Code
Debugging in Julia - Two different ways
The Julia Package Manager
REPL & Revise
Multiple Dispatch
geo
Have your own basic OsmAnd map
EverySingleStreet.jl: Map matching
EverySingleStreet.jl: Working with GPS data
tsp-solver
TSPSolver.jl: 2-opt
TSPSolver.jl: Using Bonobo.jl to solve our first instance
Bonobo.jl: Branch and Bound
TSP: Greedy approach and using a 1-Tree
MIP - Traveling Salesman
constraint-solver
Lessons Learned: A Julia Project Recap
Boolean constraints
Generic bridges
Creating bridges with JuMP.jl and MOI.jl
Priority Queue
Graph Coloring using Cliques
Refactoring
Reified constraint
Indicator Part 2
Indicator constraint + Benchmarks
Bugs and Benchmarks
Solving Str8ts
Table constraint
v0.1.0
Bound computation
Support for linear objectives
Dealing with real coefficients!
How to use JuMP for your own solver?
Finding the maximum cardinality matching in a bipartite graph
How to profile julia code?
Documentation and small changes
Graph Coloring Part 2
Graph Coloring Part 1
Recap video
UI Refactoring
Constraint Solver Part 7: Sum constraint speed-up
Backtrack and Sum constraint
Different data structure
Alldifferent constraint
More Pruning and Benchmarking
Pruning
Setup and backtracking
javis
Javis: Taxi Trip Visualization
Examples: Collatz Conjecture
Examples: Inverse Kinematics
Examples: The chase problem
First YouTube video created with Javis
Javis v0.3: How to animate a Fourier series
Javis v0.2 and the Future
Javis.jl with Animations.jl
The beginning of Javis.jl
ghess
Ghess: How to write a Chess Engine?
side-gigs
Share what you've learned!
Mentoring for beginners
kaggle-santa
Kaggle Santa 2019: Final take
Improving on the current Santa Kaggle Challenge: MIP and swapping
First approach for the Kaggle Santa 2019 challenge
Kaggle: Prime Travelling Santa 2018 - MIP
blog
Master thesis: HyperOrdering
Master thesis: Minimum degree ordering
Housekeeping August 2020
Franklin.jl
Housekeeping May 2020
simplex
Simplex: Add constraints
Simplex: Dual problem
Simplex: Convert to standard form
Simplex algorithm: Maximization problems
visualization
The beginning of Javis.jl
Pi, Tau and prime numbers
Pi vs Tau
B-splines
Bézier curves in Julia with animations
Hang your code on the wall
Analyze your Facebook messages
Visualizations Census 2013
neuro
Neuromorphic computing: Hardware
Neuralink: What's new?
Neuromorphic computing: An Overview
machine-learning
Handwritten equations to LaTeX
AlphaZero for Nash
First steps
mnist
Improve MNIST using your own handwritten digits
Recognize your handwritten numbers
Tensorflow, MNIST and your own handwritten digits
Tag: branch_and_bound
TSPSolver.jl: 2-opt
TSPSolver.jl: Using Bonobo.jl to solve our first instance
Bonobo.jl: Branch and Bound
