arXiv (All)
open access
Exact Optimal Transport by Matching
Balanced discrete optimal transport between n sources and n targets of unit mass is exactly the minimum-cost assignment problem-a bipartite perfect matching-and is therefore solvable exactly by industrial matching engines in milliseconds to seconds. We ask when the exact approach beats the standard
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
- Matching with Multiple Bottlenecks: Parameterized Complexity and Approximation#1202530
- Genuine multipartite Rains entanglement#799936
- Combinatorial Optimization#66996
- Complexity, approximation, and extension of proper $\{a,b\}$-edge-weightings#1105763
- G_q-concurrence and entanglement constraints in multiqubit systems#1062745
Record · ID 1199359
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