Applications for the Methods of
graph solutions
- Tour with shortest distance or travel time
- Tour with lowest cost
- Fastest workflow: process a task in minimum total time for succesive activities (network planning)
- Routes for public mains supply (gas, water, electric power, phone, data)
- Order of visiting a saleman`s customers
- Order of roll out of a parcel service`s packets
- Order of dropping passengers of a hailed shared taxi
- Order of drilling holes
- Order in which a postman passes streets of houses
- Order in which garbage collection collects garbage cans
- Capacity of public mains supply (gas, water, electric power, phone, data)
- Transportation routes to cover the demand of several customers by several supplies at minimum cost (Transportation Problem)
- Transportation routes for the provision of customers by several supplies using transshipment stations at minimum cost (Transshipment Problem)
- Transportation route with minimum cost using routes with constrained capacities
- Transportation route with shortest distance or travel time using routes with constrained capacities
- Assignment of activities/demands to workers/supplies at minimum total cost
- Pairwise combinations that yield minimum cost
