The valve location problem in simple network topologies

DOI10.1287/IJOC.1090.0365zbMATH Open1243.90086OpenAlexW2122270705WikidataQ57338955 ScholiaQ57338955MaRDI QIDQ2899077FDOQ2899077

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

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

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)

Cited In (3)

• An integer programming framework for critical elements detection in graphs
• The Valve Location Problem in Simple Network Topologies
• Title not available (Why is that?)

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)