Valid cuts for the design of potential-based flow networks
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- A decomposition approach for optimal gas network extension with a finite set of demand scenarios
- A reformulation-enumeration MINLP algorithm for gas network design
- Algorithmic results for potential‐based flows: Easy and hard cases
- An Application of Generalized Linear Programming to Network Flows
- An exact algorithm for robust network design
- Combinatorial acyclicity models for potential‐based flows
- Convex relaxations for gas expansion planning
- Design and operations of gas transmission networks
- Disjoint (s, t)‐cuts in a network
- Network synthesis with few edges
- Non-linear network problems
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the optimal design of water distribution networks: a practical MINLP approach
- Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
- Optimal structure of gas transmission trunklines
- Optimization of capacity expansion planning for gas transportation networks
- Optimization of pipe networks
- Reduction of Potential-Based Flow Networks
- Simple Constructions for Multiterminal Network Flow Synthesis
- Single-commodity robust network design problem: complexity, instances and heuristic solutions
- Submodular function minimization
- Sufficient pruning conditions for MINLP in gas network design
- Valid inequalities for the topology optimization problem in gas network design
This page was built for publication: Valid cuts for the design of potential-based flow networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880142)
