Combinatorial acyclicity models for potential‐based flows
From MaRDI portal
Recommendations
- Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks
- scientific article; zbMATH DE number 3906221
- Combinatorial approaches to multiflow problems
- Potentials in Undirected Graphs and Planar Multiflows
- Combinatorial continuous maximum flow
- Graphical models and belief propagation hierarchy for physics-constrained network flows
- Multicommodity flows in cycle graphs
- On the robustness of potential-based flow networks
- Combinatorial algorithms for inverse network flow problems
Cites work
- A note on finding the bridges of a graph
- A reduction technique for natural gas transmission network optimization problems
- Algorithmic results for potential‐based flows: Easy and hard cases
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and algorithms
- Computing convex hulls and counting integer points with \texttt{polymake}
- Evaluating Gas Network Capacities
- Finding k Disjoint Paths in a Directed Planar Graph
- Global optimization of mixed-integer ODE constrained network problems using the example of stationary gas transport
- Global optimization of nonlinear network design
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 193808 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- Mixed-integer optimization with ordinary differential equations for gas networks
- Non-linear network problems
- On the acyclic subgraph polytope
- Optimization models for operative planning in drinking water networks
- polymake: a framework for analyzing convex polytopes
- Reducibility among combinatorial problems
- Solving the Pipe Network Analysis Problem Using Optimization Techniques
- The directed subgraph homeomorphism problem
- Three enhancements for optimization-based bound tightening
- Validation of nominations in gas network optimization: models, methods, and solutions
Cited in
(5)- An exact method for nonlinear network flow interdiction problems
- Valid cuts for the design of potential-based flow networks
- Extremal solutions for network flow with differential constraints. A generalization of spanning trees
- Improved mixing and pressure loss formulations for gas network optimization
- Adjustable robust nonlinear network design without controllable elements under load scenario uncertainties
This page was built for publication: Combinatorial acyclicity models for potential‐based flows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065854)
