Optimal discrete pipe sizing for tree-shaped \(\mathrm{CO}_2\) networks
DOI10.1007/S00291-024-00773-ZMaRDI QIDQ6667802
Janina Zittel, Jaap Pedersen, Thi Thai Le, Thorsten Koch
Publication date: 21 January 2025
Published in: OR Spectrum (Search for Journal in Brave)
mixed integer linear programmingnetwork designcarbon capture and storagethermophysical modeling\(\mathrm{CO}_2\) pipeline transportdiscrete pipeline sizing
Programming involving graphs or networks (90C35) Integer programming (90C10) Nonlinear programming (90C30) Deterministic network models in operations research (90B10)
Cites Work
- Mathematical programming techniques in water network optimization
- Optimal pipe-sizing problem of tree-shaped gas distribution networks
- On the optimal design of water distribution networks: a practical MINLP approach
- Optimization of capacity expansion planning for gas transportation networks
- Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches
- High detail stationary optimization models for gas networks
- Robust optimal discrete arc sizing for tree-shaped potential networks
- Evaluating Gas Network Capacities
- Algorithmic results for potential‐based flows: Easy and hard cases
- 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)
