The valve location problem in simple network topologies

DOI10.1287/IJOC.1090.0365MaRDI QIDQ2899077zbMATH OpenOpenAlexWikidataFDO

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

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) Graph algorithms (graph-theoretic aspects) (05C85) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Recommendations

• The Valve Location Problem in Simple Network Topologies
• scientific article; zbMATH DE number 25606
• scientific article; zbMATH DE number 1067871
• scientific article; zbMATH DE number 3845637
• scientific article; zbMATH DE number 512818

Cited in

(3)

• The Valve Location Problem in Simple Network Topologies
• An integer programming framework for critical elements detection in graphs
• scientific article; zbMATH DE number 7310279 (Why is no real title available?)

This page was built for publication: The valve location problem in simple network topologies

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