arXiv (All)
open access
A branch-and-filter method for mixed-integer linear programming
We develop a new tree-search framework for mixed-integer linear programming problems, which incorporates a filter mechanism as a node-acceptance device. The introduced branch-and-filter algorithm combines proper branching actions with a filter on integrality violation and an incumbent-dependent obje
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
- Constrained Graph Diffusion for Mixed Integer Optimization#1202193
- Integer Programming and Combinatorial Optimization#3580
- Stronger Hardness for Submodular Maximization Subject to a Matroid Constraint#1216762
- An Intersection Cutting Plane Algorithm for Chance-Constrained Programs with Finite Support#1119019
- A branch-cut-and-price algorithm for the park-and-loop routing problem#433298
Record · ID 1447532
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