CHAP's cross-platform portfolio finds feasible solutions for 47 of 50 MIP benchmark instances in five minutes, beating Gurobi (44) and cuOpt (43) by coordinating GPU tabu search with CPU fix-and-propagate and feasibility pump via a shared pool.
PhD thesis, Technische Universität Berlin
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
representative citing papers
Adaptive multi-criteria scoring with online logistic regression for Benders subproblem selection yields statistically significant runtime and integral improvements on 135 survivable network design instances.
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
citing papers explorer
-
CHAP: A Hybrid GPU-CPU Heuristic for MIP
CHAP's cross-platform portfolio finds feasible solutions for 47 of 50 MIP benchmark instances in five minutes, beating Gurobi (44) and cuOpt (43) by coordinating GPU tabu search with CPU fix-and-propagate and feasibility pump via a shared pool.
-
Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design Problems
Adaptive multi-criteria scoring with online logistic regression for Benders subproblem selection yields statistically significant runtime and integral improvements on 135 survivable network design instances.
-
Logic-Constrained Shortest Paths for Flight Planning
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.