At COSLING, we design and develop custom optimization algorithms tailored to the unique needs of our clients. Our team supports you throughout the entire process, from the development of a Proof of Concept (POC) to the deployment of industrialized solutions fully integrated into your information system. Whether you need to quickly prototype an idea or deploy a robust, scalable solution, we provide personalized support to maximize the impact of your decisions and the performance of your business processes.
Constraint Programming (CP) is a wonderful technology enabling to solve constrained Configuration and Optimization problems. At the crossroad between Artificial Intelligence and Operations Research, this component-based approach allows to build applications that are flexible, efficient and scalable. We design efficient models as well as advanced components (global constraints, search heuristics, large neighborhood search, etc.). We use different solvers, notably Choco Solver that we develop together with IMT Atlantique, and ORTools CPSAT that is developed by Google.
Linear Programming (LP) is a technology stemming from Operations Research that is used to solve combinatorial problems. We develop linear, integer and mixed models and embeds advanced solving techniques, such as Branch and Cut or CP hybrids. We use both commercial and open source solvers.
We design specific algorithms to best meet your needs : greedy algorithms, meta-heuristics, etc. Our constraint programming background enables us to design efficient algorithms that are easy to maintain, even if no solver is used.