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

DOI10.1137/S1052623496313684zbMath0959.68137MaRDI QIDQ4702334

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

Publication date: 24 November 1999

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

zbMATH Keywords

communication networksinterior-point methodsbounding theorembacktrackgeneralized Steiner minimum tree problemk-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)

Related Items (5)

Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic ⋮ Maximising the worth of nascent networks ⋮ The regularity of optimal irrigation patterns ⋮ The structure of branched transportation networks ⋮ A Modica-Mortola approximation for branched transport and applications

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