Algorithms for
multi-commodity flow problems

Algorithms for
multi-commodity flow problems

Flowty offer unique IP to logistics businesses

Flowty offer unique IP to logistics businesses

Precision

Precison

App Stats
App Stats
App Stats

Speed

Scale

The research behind our technology

Flowty's foundational research has tackled some of the most challenging variants of multi-commodity flow problems, which are so complex that they are typically out of reach for general-purpose solvers.


Flowty's highly parallel pull labelling algorithm for the resource constrained shortest path problem

The resource constrained shortest path problem (RCSPP) is a key subproblem in many decomposition approaches. This work presents a parallel pull labelling algorithm that improves scalability and parallelisation significantly.

Flowty at scale: Solving multi-commodity flow instances with millions of commodities

Flowty's path-based solver can solve now solve multi-commodity flow instance with over one million commodities.

Path-based multi-commodity flow solver

The Flowty multi-commodity flow solver is grounded in deep academic insight into the structure and complexity of multi-commodity flow problems.

Read more

Read more

A proven legacy in column generation performance

Column generation has long been the dominant technique for solving complex network optimisation problems. Our team has helped define its modern evolution, combining theoretical depth with record-breaking practical performance.

Read more

Read more

The research behind our technology

Flowty's foundational research has tackled some of the most challenging variants of multi-commodity flow problems, which are so complex that they are typically out of reach for general-purpose solvers.


Path-based multi-commodity flow solver

The Flowty multi-commodity flow solver is grounded in deep academic insight into the structure and complexity of multi-commodity flow problems.

Read more

Read more

A proven legacy in column generation performance

Column generation has long been the dominant technique for solving complex network optimisation problems. Our team has helped define its modern evolution, combining theoretical depth with record-breaking practical performance.

Read more

Read more

Flowty at scale: Solving multi-commodity flow instances with millions of commodities

Flowty's path-based solver can solve now solve multi-commodity flow instance with over one million commodities.

Flowty's highly parallel pull labelling algorithm for the resource constrained shortest path problem

The resource constrained shortest path problem (RCSPP) is a key subproblem in many decomposition approaches. This work presents a parallel pull labelling algorithm that improves scalability and parallelisation significantly.