HAL (France)
open access
Kernel Pump: Boosting the convergence of the feasibility pump through a kernel search-based decomposition
Feasibility Pump (FP) is a well-studied mixed integer linear programming primal heuristic that sequentially guides fractional solutions into integer feasibility by minimizing their distance to given target integer points, while preserving the linear constraints of the original problem. Due t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Matching with Multiple Bottlenecks: Parameterized Complexity and Approximation#1202530
- Upper Bounds on Efficiency of Pixel Antennas#1156042
- Integer Programming and Combinatorial Optimization#3580
- NP-hardness of ideal lattice problems#1109858
- Integer and combinatorial optimization#1331416
Record · ID 1203720
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive