Skip to content

FastPart: A Powerful Portfolio-based Hypergraph Partitioner

Unknown authors
· 0 citations · 38 references

TL;DR

K-adaptive Ensembled Partitioning (KEP) is presented, which combines recursive bisection and direct 𝐾 -way search and replaces hard-feasibility Fiduccia–Mattheyses (FM) with an augmented-Lagrangian refinement step (AL-FM) that can cross short infeasible regions before repairing balance.

View source

Similar papers

Preprint Sep 2026

Race, Exchange, Improve: Finding high-quality MIP solutions quickly

Mixed-integer programming (MIP) is a cornerstone in applied optimization, both in industry and academia. Recently, there has been increased attention to finding strong primal solutions quickly. This is reflected, for example, in the development of the NVIDIA cuOpt solver and, most recently, in the new MIPFEAS benchmark...

Gioni Mexi, D. Rehfeldt · 1 citation

Dual-GNN Multilevel Coarsening for Maximum Independent Set

The Dual-GNN Multilevel Coarsening framework uses learning to guide multilevel graph coarsening while retaining combinatorial search for final decision making and achieves the best mean solution quality among all evaluated methods.

Tian-Feng Chen, Xian-Yue Li · 0 citations
#artificial intelligence Preprint Sep 2026

Partition Scores Are Not System Scores: Deployment-Fidelity Gaps in Decomposed Algorithm Selection

The deployment-fidelity gap G(R) is defined as the difference between partition-level and deployable end-to-end utility and derive two accounting consequences: a per-instance margin-regret stability condition that tells us when a partition-time family choice is deployment-optimal, and a sharp partition-only identificat...

Jiacheng Zhang, Yu Tang, Li Zhu · 0 citations
Conference Open access Sep 2026

ULE-MWC: An UnLocking-Enhanced Lookahead Framework for Exact Maximum Weight Clique Search

A new solver is developed, ULE-MWC (UnLocking Enhanced MWC), which consistently yields tighter upper bounds and outperforms state-of-the-art exact solvers in both runtime and search efficiency.

Mingming Jin, Chu-Min Li, Kun He · 0 citations
Sep 2026

Presolve heuristics in HiGHS: implementation and computational study

We present reference implementations of four published primal heuristics for mixed-integer programming inside the open-source solver HiGHS (Huangfu and Hall, 2018): Feasibility Jump (Luteberget and Sartor, 2023), fix-propagate-repair (FPR; Salvagnin, Roberti and Fischetti, 2025) with its LP-guided dive-time variant, Lo...

Simon Spoorendonk · 0 citations
Aug 2026

Coluna.jl: A Branch-Cut-and-Price Framework in Julia

This paper introduces Coluna.jl, an innovative BCP framework developed in Julia, a language known for its high computational performance and ease of use, and establishes Coluna.jl as a significant contribution to the field of optimization software.

F. Vanderbeck, Guillaume Marquès, R. Sadykov et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.