Hexaly, The next-generation MIP solver
Hexaly Optimizer is the next-generation MIP solver. Its modeling interface is nonlinear and set-oriented. In a sense, Hexaly APIs unify and extend modeling concepts from mixed-linear programming, nonlinear programming, constraint programming, and black-box optimization. Under the hood, Hexaly combines exact and heuristic optimization methods, such as branch-and-bound, automatic Dantzig-Wolfe reformulation, column and row generation, propagation, local search, direct search, and surrogate modeling techniques. Regarding performance benchmarks, Hexaly distinguishes itself from leading solvers such as Gurobi, IBM Cplex, and Google OR Tools by delivering scalable solutions for Routing, Scheduling, Packing, Clustering, and Location problems. This talk introduces our set-based modeling formalism and highlights its scalability for large instances, while explaining how the solver automatically leverages state-of-the-art exact and heuristic techniques.
Palabras clave: optimization software heristics