A dynamic programming approach for the pipe network layout problem
DOI10.1016/J.EJOR.2019.02.036zbMATH Open1430.90172OpenAlexW2917145615WikidataQ128387169 ScholiaQ128387169MaRDI QIDQ1735166FDOQ1735166
Yasufumi Saruwatari, Hisatoshi Suzuki, Naoshi Shiono
Publication date: 28 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.02.036
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Dynamic programming (90C39)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combinatorial optimization. Theory and algorithms.
- Optimisation of gravity-fed water distribution network design: a critical review
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Mathematical programming techniques in water network optimization
- Optimal Design of Gas Pipeline Networks
- Minimum Concave Cost Flows in Certain Networks
- Optimal pipe-sizing problem of tree-shaped gas distribution networks
- Title not available (Why is that?)
- An improved decomposition-based heuristic to design a water distribution network for an irrigation system
- Faster shortest-path algorithms for planar graphs
- Optimization of pipe networks
- Evaluating Gas Network Capacities
- The steiner problem in graphs
- Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
- A three-phase procedure for designing an irrigation system's water distribution network
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Title not available (Why is that?)
- Faster exact algorithms for steiner trees in planar networks
Cited In (6)
- A Bilevel Programming Method for Pipe Network Optimization
- Computing the Minimum Cost Pipe Network Interconnecting One Sink and Many Sources
- A method to design a hierarchical network of field pipelines by solving a sequence of extremal problems
- Optimal urban sewer layout design using Steiner tree problems
- Title not available (Why is that?)
- A graph-theoretic approach to explicit nonlinear pipe network optimization
Uses Software
This page was built for publication: A dynamic programming approach for the pipe network layout problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735166)
