Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources

DOI10.1137/S1052623496313684MaRDI QIDQ4702334zbMATH OpenFDO

Authors Guoliang Xue, Theodore P. Lillys, D. E. Dougherty

Publication date 24 November 1999

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S1052623496313684

zbMATH Keywords

backtrackbounding theoremcommunication networksgeneralized Steiner minimum tree probleminterior-point methodsk-optimalminimum cost pipe network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Deterministic network models in operations research (90B10)

Recommendations

• Optimization of pipe networks
• A dynamic programming approach for the pipe network layout problem
• A graph-theoretic approach to explicit nonlinear pipe network optimization
• Optimal connection problem of single source multiple sinks on directed networks
• scientific article; zbMATH DE number 1336315
• Minimum cost multiflows in undirected networks
• Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
• scientific article; zbMATH DE number 6967927
• scientific article; zbMATH DE number 4108535
• A Bilevel Programming Method for Pipe Network Optimization

Cited in

(8)

• Construction of the current Steiner network of the second optimality rank
• Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic
• Maximising the worth of nascent networks
• scientific article; zbMATH DE number 1336315 (Why is no real title available?)
• The Valve Location Problem in Simple Network Topologies
• A Modica-Mortola approximation for branched transport and applications
• The regularity of optimal irrigation patterns
• The structure of branched transportation networks

This page was built for publication: Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4702334)