Combinatorial acyclicity models for potential‐based flows

DOI10.1002/NET.22038OpenAlexW3154323397MaRDI QIDQ6065854

Marc E. Pfetsch, Oliver Habeck

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22038

zbMATH Keywords

valid inequalitiesnetwork optimizationmixed integer programgas networkspotential-based flowsacyclic flows

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (1)

An exact method for nonlinear network flow interdiction problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization models for operative planning in drinking water networks
• Certifying 3-edge-connectivity
• Three enhancements for optimization-based bound tightening
• The directed subgraph homeomorphism problem
• A note on finding the bridges of a graph
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A reduction technique for natural gas transmission network optimization problems
• Computing convex hulls and counting integer points with \texttt{polymake}
• Evaluating Gas Network Capacities
• Validation of nominations in gas network optimization: models, methods, and solutions
• Non-linear network problems
• On the acyclic subgraph polytope
• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• Finding k Disjoint Paths in a Directed Planar Graph
• Reducibility among Combinatorial Problems
• Global Optimization of Mixed-Integer ODE Constrained Network Problems Using the Example of Stationary Gas Transport
• Algorithmic results for potential‐based flows: Easy and hard cases
• Global Optimization of Nonlinear Network Design
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Combinatorial acyclicity models for potential‐based flows