The Valve Location Problem in Simple Network Topologies

DOI10.1287/ijoc.1090.0365zbMath1243.90086OpenAlexW2122270705WikidataQ57338955 ScholiaQ57338955MaRDI QIDQ2899077

Albert Hendriks, Nadejda V. Grigorieva, Alexander Grigoriev, Hans L. Bodlaender

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1090.0365

zbMATH Keywords

valve location problem computational complexity bounded treewidth dynamic programming binary search

Mathematics Subject Classification ID

Applications of graph theory (05C90) Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

An integer programming framework for critical elements detection in graphs ⋮ Unnamed Item

This page was built for publication: The Valve Location Problem in Simple Network Topologies