The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Implementation of two transportation problem algorithms. 1. North West Corner Method 2. Minimum Cost Method or Least cost method. For more technical details about the algorithms please refer below URLs. <http://www.universalteacherpublications.com/univ/ebooks/or/Ch5/nw.htm>. <http://personal.maths.surrey.ac.uk/st/J.F/chapter7.pdf>.
| Version: | 0.1 |
| Published: | 2016-02-13 |
| DOI: | 10.32614/CRAN.package.TransP |
| Author: | Somenath Sit |
| Maintainer: | Somenath Sit <somenath.bhu.2010 at gmail.com> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | https://github.com/Somenath24/TransP |
| NeedsCompilation: | no |
| Materials: | README |
| CRAN checks: | TransP results |
| Reference manual: | TransP.pdf |
| Package source: | TransP_0.1.tar.gz |
| Windows binaries: | r-devel: TransP_0.1.zip, r-release: TransP_0.1.zip, r-oldrel: TransP_0.1.zip |
| macOS binaries: | r-release (arm64): TransP_0.1.tgz, r-oldrel (arm64): TransP_0.1.tgz, r-release (x86_64): TransP_0.1.tgz, r-oldrel (x86_64): TransP_0.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=TransP to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.