arXiv Biology
open access
Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem
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
- Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem#174017
- Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem#173439
- Validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem#173189
- On the worst case complexity of potential reduction algorithms for linear programming#429995
- Low-Rank and Lifted Semidefinite Programming for Mixed-Integer Polynomial Power Grid Optimization#1143036
Record · ID 172173
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