arXiv (All)
open access
A Network Simplex Framework For Discrete Unbalanced Optimal Transport
The network simplex method is a classical algorithm for minimum cost flow problems formulated as linear programs, that has attracted recent interest from the optimal transport community. Indeed, discrete optimal transport is a subclass of minimum cost flow for which network simplex techniques comput
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
- Constrained optimal transport with applications to large matching markets#609898
- Endogenous Interface Pricing for Consistent Transmission–Distribution Co-Optimization With Discrete Distribution Controls#624372
- Sliced-Regularized Optimal Transport#1116256
- Accelerated Algorithm for Sparse Regularized Partial Optimal Transport#1154344
- Accelerated Algorithm for Sparse Regularized Partial Optimal Transport#1136844
Record · ID 1298343
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