arXiv (OAI Expanded)
open access
Using a MIP Solver as a PDHG-Based MIP Heuristic
The PDHG algorithm provides a new capability for solving difficult linear programming (LP) problems: the ability to find low-accuracy solutions quickly. While such solutions may not be applicable in all applications of LP, one possible use is to accelerate heuristics for finding feasible solutions 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
- Using a MIP Solver as a PDHG-Based MIP Heuristic#925204
- Verifying Well-Posedness of Linear PDEs using Convex Optimization#1012174
- Robust POMDP Framework for Lung Cancer Screening Problems#999987
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1062470
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1043098
Record · ID 920969
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