Boris is originally from Tajikistan. He has been developing software for more than 35 years. Some of the languages he used were Assembler, Lisp, Prolog, C, Java, and Python. Coding in Erlang since 2009 and in Elixir since 2015. Boris has a Bachelor’s degree in applied math and a Master’s degree in advanced combinatorics. Married, 3 kids. Currently based in Ontario, Canada.
Constraint programming is a paradigm for solving combinatorial problems. CP solvers such as Google’s OR-Tools, IBM’s CPLEX, Gecode, and many others are adopted by the industry for decision-making on a huge range of problems, such as planning, scheduling, and optimization of business processes… Every major programming language has constraint programming tools, so why not have it in Elixir?
In the book by Peter Van Roy and Seif Haridi, the authors suggest that the constraint programming paradigm can be efficiently implemented using a “maximally concurrent” model, which makes BEAM a great candidate for the implementation of CP solvers.
The project that I’m going to talk about is Fixpoint.
LiveBook demonstrates the current capabilities of the Fixpoint solver.