arXiv (All)
open access
Formally Certifying the Vertex Set of a Polyhedron Faster than Informal Enumeration
The computation of the vertices of a polyhedron described by a system of linear inequalities is a central problem in polyhedral computation. It is a fundamental step in the conversion between H-representations, by linear inequalities, and V-representations, by vertices and extreme rays. This operati
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
- Computing Lower Bounds on the Non-negative Rank via SAT Solvers#1249230
- Crown graphs maximise the representation number of bipartite graphs#1130684
- Standard Quadratic Formulations of Many NP Problems: A Simplex-Based Compilation Framework for Combinatorial Optimization#1157182
- The Undirected m -Peripatetic Salesman Problem: Polyhedral Results and New Algorithms#676846
- Analysis of copositive optimization based linear programming bounds on standard quadratic optimization#955121
Record · ID 1249193
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