package optiml-transport
Solve optimal transportation problems using the network simplex algorithm
Install
Dune Dependency
Authors
Maintainers
Sources
0.0.1.tar.gz
md5=f9895528430b9ac5fcd685d12b14acab
sha512=39e720b27e08fb7e225aac17919c3964cfe89798983a92e8dea425e742d0a595a1cf9a2e177342f4e8af86c96a7fb8cce30f9ec40254ab32c306805e5bdb9a58
README.md.html
README.md
optiml-transport - optimal transportation using the network simplex algorithm
These are some bindings to a solver for the optimal transportation problem. The solver uses the network simplex algorithm and is reasonably efficient. The underlying c++ code was obtained through the Python Optimal Transportation toolkit (POT), which itself used some code by Nicolas Bonneel, using some code from the LEMON library.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>