Category: Blog
-
How to Learn Mixed-Integer Programming Algorithms: Relaxations, Branch-and-Bound, Cutting Planes and Branch-and-Cut
A beginner-to-professional learning manual for mixed-integer programming algorithms: LP relaxations, branch-and-bound, cutting planes, presolve, heuristics, MIP gaps, numerical reliability and professional model design.
-
How to Learn Clustering Algorithms: k-Means, Hierarchical Clustering, DBSCAN and Spectral Methods
A beginner-to-professional learning manual for clustering algorithms: k-means, hierarchical linkage, DBSCAN, spectral clustering, scaling, validation, stability and professional model selection.
-
How to Learn Error-Correcting Code Algorithms: Hamming Distance, Syndromes, Reed–Solomon and Iterative Decoding
A beginner-to-professional learning manual for error-correcting code algorithms: Hamming distance, linear codes, syndromes, Hamming codes, Reed–Solomon, LDPC graphs and iterative decoding.
-
How to Learn Markov Chain Monte Carlo Algorithms: Metropolis–Hastings, Gibbs Sampling, HMC and Convergence Diagnostics
A beginner-to-professional learning manual for MCMC algorithms: Metropolis–Hastings, Gibbs sampling, autocorrelation, effective sample size, R-hat, Hamiltonian Monte Carlo, NUTS and convergence diagnostics.
-
How to Learn Numerical Linear Algebra Algorithms: Gaussian Elimination, LU, QR, SVD and Conditioning
A beginner-to-professional learning manual for numerical linear algebra algorithms: Gaussian elimination, LU, pivoting, conditioning, QR, SVD, sparse systems, iterative methods and professional numerical validation.
-
How to Learn Submodular Optimisation Algorithms: Diminishing Returns, Greedy Guarantees and Constraint-Aware Selection
A beginner-to-professional learning manual for submodular optimisation: diminishing returns, marginal gains, greedy guarantees, lazy evaluation, budgets, matroid constraints and scalable selection.
