CP 2024 Presentation (Best Paper Award)
Image credit:Abstract
Mixed integer programming (MIP) is a fundamental model in operations research. Local search is a powerful method for solving hard problems, but the development of local search solvers for MIP still needs to be explored. This work develops an efficient local search solver for solving MIP, called Local-MIP. We propose two new operators for MIP to adaptively modify variables for optimizing the objective function and satisfying constraints, respectively. Furthermore, we design a new weighting scheme to dynamically balance the priority between the objective function and each constraint, and propose a two-level scoring function structure to hierarchically guide the search for high-quality feasible solutions. Experiments are conducted on seven public benchmarks to compare Local-MIP with state-of-the-art MIP solvers, which demonstrate that Local-MIP significantly outperforms CPLEX, HiGHS, SCIP and Feasibility Jump, and is competitive with the most powerful commercial solver Gurobi. Moreover, Local-MIP establishes 4 new records for MIPLIB open instances.
Date
Sep 4, 2024 12:00 AM — 12:00 AM
Event
Location
Girona, Catalonia, Spain
Girona
Click on the Slides button above to view the built-in slides feature.
Slides can be added in a few ways:
- Create slides using Hugo Blox Builder’s Slides feature and link using
slidesparameter in the front matter of the talk file - Upload an existing slide deck to
static/and link usingurl_slidesparameter in the front matter of the talk file - Embed your slides (e.g. Google Slides) or presentation video on this page using shortcodes.
Further event details, including page elements such as image galleries, can be added to the body of this page.
