TL;DR
CHAP is a hybrid GPU-CPU heuristic framework for mixed-integer programming that coordinates multiple heuristics to improve solution quality within limited time, outperforming some existing solvers on benchmark instances.
Contribution
The paper introduces a novel GPU-CPU hybrid primal heuristic framework that integrates multiple heuristics via a shared solution pool for enhanced MIP solving.
Findings
CHAP finds solutions to 47 out of 50 benchmark instances within five minutes.
It outperforms Gurobi in default mode on the benchmark.
It surpasses NVIDIA cuOpt in heuristics-only mode on the benchmark.
Abstract
We present CHAP (Coordinating Heuristics Across Platforms) a GPU-CPU-hybrid primal heuristic framework for mixed-integer programming. CHAP adopts a portfolio approach where it coordinates a set of primal heuristics, including Local Search, Fix-and-Propagate, and Feasibility Pump, via a shared solution pool. The solution pool is used to exchange feasible incumbent solutions, LP solutions, along with promising infeasible solution candidates, enabling a more comprehensive exploration of the solution space. On the GPU side, we implement a native tabu search featuring a novel best-shift algorithm built on sort, scan, and reduce primitives, along with specialized kernel designs. We additionally leverage cuPDLPx as an approximate LP solver. On the CPU side, we employ various Fix-and-Propagate strategies, guided by information from the solution pool, complemented by a CPU-based tabu search and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
