Look for the minimum cost flow from origins to destinations (Application developed from skeleton application)


Download data

Main examples menu

Versión española

The problem of flow of a minimum cost is to find the way of transport of a product from the origin nodes, sources nodes, to the destination nodes, sink nodes. Each pair origin destinationship has associated an unitary cost and each link between two nodes has a maximum capacity that can not be exceeded.

This application has been developed from the application skeleton for didactic purposes. The skeleton application has been developed so that the creation of applications like this one does not require knowledge of shiny or html.

A free course is available on request, which explains in detail how to do this process.

To start: select an action, input values for parameters, and press "Go". Select the tab to show. You can enter new values and the results will be updated automatically.

Developed using shiny by M. Muñoz-Márquez under GNU-GPL licence inside R-UCA Project.