Yan Georget

Case study: the quasigroups existence problem Yan Georget · Follow Published in Towards Data Science · 5 min read · 7 hours ago — TLDR Some mathematical theorems can be solved by combinatorial exploration. In this article, we focus on the problem of the existence of some quasigroups. We will demonstrate the existence or non existence of some quasigroups using NuCS. NuCs is a fast constraint solver written 100% in Python that I am currently

Case study: the travelling salesman problem Yan Georget · Follow Published in Towards Data Science · 8 min read · 9 hours ago — TLDR Constraint Programming is a technique of choice for solving a Constraint Satisfaction Problem. In this article, we will see that it is also well suited to small to medium optimization problems. Using the well-known travelling salesman problem (TSP) as an example, we will detail all the steps leading to an

Photo by Eric Prouzet on Unsplash Blazing-fast constraint solving in pure Python Yan Georget · Follow Published in Towards Data Science · 6 min read · 3 days ago — TLDR NuCS is a Python library for solving Constraint Satisfaction and Optimisation Problems (CSP and COP) that I am developing as a side project. Because it is 100% written in Python, NuCS is easy to install and allows to model complex problems in a few