Optimal discrete pipe sizing for tree-shaped CO₂ networks
DOI10.1007/S00291-024-00773-ZMaRDI QIDQ6667802FDOQ6667802
Authors: Jaap Pedersen, Thi Thai Le, Thorsten Koch, Janina Zittel 
Publication date: 21 January 2025
Published in: OR Spectrum (Search for Journal in Brave)
Recommendations
- Optimal pipe-sizing problem of tree-shaped gas distribution networks
- Scalable algorithms for designing \(\mathrm{CO}_2\) capture and storage infrastructure
- Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic
- A dynamic programming approach for the pipe network layout problem
- Optimal Dimensioning of Pipe Networks with Application to Gas Transmission Networks
mixed integer linear programmingnetwork designcarbon capture and storagethermophysical modeling\(\mathrm{CO}_2\) pipeline transportdiscrete pipeline sizing
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Integer programming (90C10)
Cites Work
- Optimization of capacity expansion planning for gas transportation networks
- Mathematical programming techniques in water network optimization
- On the optimal design of water distribution networks: a practical MINLP approach
- Optimal pipe-sizing problem of tree-shaped gas distribution networks
- Evaluating Gas Network Capacities
- High detail stationary optimization models for gas networks
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Algorithmic results for potential‐based flows: Easy and hard cases
- Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches
- Implications, conflicts, and reductions for Steiner trees
This page was built for publication: Optimal discrete pipe sizing for tree-shaped \(\mathrm{CO}_2\) networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6667802)
