A dynamic programming approach for the pipe network layout problem

DOI10.1016/J.EJOR.2019.02.036zbMath1430.90172OpenAlexW2917145615WikidataQ128387169 ScholiaQ128387169MaRDI QIDQ1735166

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

zbMATH Keywords

dynamic programmingOR in energyminimum concave cost network flow problempipe network design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Dynamic programming (90C39)

Uses Software

• Gurobi
• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimisation of gravity-fed water distribution network design: a critical review
• Mathematical programming techniques in water network optimization
• Optimal pipe-sizing problem of tree-shaped gas distribution networks
• An improved decomposition-based heuristic to design a water distribution network for an irrigation system
• Optimization of pipe networks
• A three-phase procedure for designing an irrigation system's water distribution network
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Evaluating Gas Network Capacities
• Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Optimal Design of Gas Pipeline Networks
• Faster exact algorithms for steiner trees in planar networks
• Minimum Concave Cost Flows in Certain Networks
• The steiner problem in graphs
• Combinatorial optimization. Theory and algorithms.
• Faster shortest-path algorithms for planar graphs

This page was built for publication: A dynamic programming approach for the pipe network layout problem