Minimum flow decomposition in graphs with cycles using integer linear programming

DOI10.1007/S10898-025-01556-8MaRDI QIDQ6876207zbMATH OpenFDO

Authors Fernando H. C. Dias, Lucia Williams, Brendan Mumey, Alexandru I. Tomescu

Publication date 13 January 2026

Published in Journal of Global Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10898-025-01556-8

zbMATH Keywords

integer linear programmingnetwork flowbioinformaticsflow decompositiontransportation science

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• A decomposition algorithm for solving certain classes of production-transportation problems with concave production cost
• A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables
• A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
• A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
• An almost optimal algorithm for unbounded searching
• Capacity and flow assignment of data networks by generalized Benders decomposition
• Depth-First Search and Linear Graph Algorithms
• Fast, flexible, and exact minimum flow decompositions via ILP
• Flow Decomposition with Subpath Constraints
• Integer Programming Formulation of Traveling Salesman Problems
• Integer programming formulations for the elementary shortest path problem
• Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
• Solution of a Large-Scale Traveling-Salesman Problem
• Width helps and hinders splitting flows

This page was built for publication: Minimum flow decomposition in graphs with cycles using integer linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876207)