Multiple views and Channeling Constraints make for faster models (in some cases) This post picks up from where I left off in my previous post: The Facility Location Problem. In the previous post, I gave an introduction to the problem then demonstrated how it can be modeled using PuLP. In the last section, I ported the model one-to-one into Minizinc which offers a more declarative approach to modeling for discrete optimization. The great thing about Minizinc is that it’s much richer with regards...