arXiv (All)
open access
Objective Coefficient Rounding and Almost Symmetries in Binary Programs
This article investigates the interplay of rounding objective coefficients in binary programs and almost symmetries. Empirically, reducing the number of significant bits through rounding often leads to instances that are easier to solve. One reason can be that the amount of symmetries increases, whi
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
- No Bit Left Behind: Using Brute-Force Lifting to Achieve Fully Static Binary Recompilation#1110782
- No Bit Left Behind: Using Brute-Force Lifting to Achieve Fully Static Binary Recompilation#919261
- Randomized Rounding over Dynamic Programs#274471
- ECMA-367 — Eiffel: Analysis, design and programming language (June 2006)#600262
- Computing theoretical bounds for online problems and application to bin stretching#624778
Record · ID 984101
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