The first math programming
solver based on local search

Resulting from a 5-year R&D project involving distinguished experts in computational optimization, LocalSolver is the first math programming software combining the simplicity of use of a model-and-run solver and the power of local-search techniques for combinatorial optimization. LocalSolver includes an innovative math modeling language for fast prototyping and lightweight object-oriented APIs for full integration (C++, Java, .NET).

Having declared your optimization model using mathematical operators, LocalSolver will provide you with high-quality solutions in very short running times without any tuning. Relying on local search, LocalSolver is able to scale up to 10 million binary decision variables, running on standard computers. LocalSolver is particularly suited for solving large-scale real-life combinatorial problems arising in business and industry.