High-performance solvers for network optimization.
Flowty builds a solver stack tuned for multi-commodity flow, column generation, and resource-constrained shortest paths. The components below work together as a modular system.
Built for scale
Our solvers focus on the structure of network problems, enabling exact methods to scale to large instances.
Flowty Core
C++ solver core with Python bindings and network-focused MIP tooling.
Network MIP modeling
Problem modeling that aligns with network flow structure for performance.
Column generation
Path-based and tree-based decompositions for large-scale instances.
Solver integration
Connects to open-source and commercial LP/MIP backends.
GPU acceleration
GPU-accelerated master problem solving and time-indexed network optimization.
Multi-Commodity Flow Solver
Exact algorithms for high-volume demand networks, using column generation over paths or trees for faster solves than direct LP at scale.
Tree-based formulation
Column generation over trees, aggregating commodities by source to keep the master compact.
Path-based decomposition
Column generation over paths to decompose large multi-commodity flow instances with flexible, fine-grained control.
Scalable pricing
Resource-constrained shortest path engines to accelerate pricing sub-problems.
Constrained Shortest Path Solver
High-performance resource-constrained shortest path engines for routing, scheduling, and pricing.
Pull labelling
Bucketed label storage and cache-friendly pull extensions.
Parallel dominance
Vectorized comparisons to prune labels efficiently.
Bidirectional search
Dynamic midpoint strategies for balanced search.
Acquisition inquiries
Flowty's algorithms, solvers, and surrounding IP are available for acquisition. Get in touch to discuss.
Try the solver: docs.flowty.ai
CVR 39946408