In the last few years there has been remarkable progress in our understanding of combinatorial discrepancy and in particular its algorithmic aspects. In addition to leading to efficient algorithms for various problems where only non-constructive proofs were known before, these methods have also led to improved results and various new connections between discrepancy and convex geometry, optimization and probability. In this talk, we will give an overview of some of these developments.