Combinatorial acyclicity models for potential‐based flows
Authors:
Open Access
Abstract
Potential‐based flows constitute a basic model to represent physical behavior in networks. Under natural assumptions, the flow in such networks must be acyclic. The goal of this article is to exploit this property for the solution of corresponding optimization problems. To this end, we introduce several combinatorial models for acyclic flows, based on binary variables for flow directions. We compare these models and introduce a particular model that tries to capture acyclicity together with the supply/demand behavior. We analyze properties of this model, including variable fixing rules. Our computational results show that the usage of the corresponding constraints speeds up solution times by about a factor of 3 on average and a speed‐up of a factor of almost 5 for the time to prove optimality.Keywords
This publication has 23 references indexed in Scilit:
- Validation of nominations in gas network optimization: models, methods, and solutionsOptimization Methods and Software, 2014
- Global Optimization of Nonlinear Network DesignSIAM Journal on Optimization, 2013
- Optimization models for operative planning in drinking water networksOptimization and Engineering, 2008
- polymake: a Framework for Analyzing Convex Polytopes2000
- Finding k Disjoint Paths in a Directed Planar GraphSIAM Journal on Computing, 1994
- On the acyclic subgraph polytopeMathematical Programming, 1985
- A common network flow formulation for several civil engineering problemsCivil Engineering Systems, 1984
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980
- A note on finding the bridges of a graphInformation Processing Letters, 1974
- Reducibility among Combinatorial Problems1972