arXiv (All)
open access
Mitigating Performance Variability in Mixed-Integer Programming Solvers via LP State Steering
Modern mixed-integer programming (MIP) solvers repeatedly solve linear programming (LP) relaxations, but the LP state transferred from the simplex algorithm to the branch-and-bound tree is typically treated as an artifact of perturbation, presolve history, and numerical trajectory. This is harmless
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
- Optimization of Quadratic Sieve Algorithm Implementation for Large Integer Factorization#974687
- Complexity of the simplex algorithm#787569
- Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction#973425
- A Temporal Planning Framework for Disruption Aware Dynamic Route Optimization in Heterogeneous Railway Systems#271878
- BRANCH-MoE: Balance-Aware Tree Routing for Large Embedding Models#1215812
Record · ID 1342144
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