The Valve Location Problem in Simple Network Topologies

References

• Alon N., Seymour P., Thomas R. A separator theorem for graphs with an excluded minor and its applications. Proc. 22nd Sympos. Theory Comput. (STOC'1980) (1980) (ACM, New York) 293–299Google Scholar
• Barefoot C. A., Entringer R., Swart H. C. Integrity of trees and the diameter of a graphs. Congressus Numerantium (1987a) 58:103–114Google Scholar
• Barefoot C. A., Entringer R., Swart H. C. Vulnerability in graphs: A comparative survey. J. Combin. Math. Combin. Comput. (1987b) 1:12–22Google Scholar
• Bodlaender H. L. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. (1996) 25:1305–1317Crossref, Google Scholar
• Bodlaender H. L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. (1998) 209(1–2):1–45Crossref, Google Scholar
• Bodlaender H. L., Fomin F. V. Treewidth: Characterizations, applications, and computations. 32nd Internat. Workshop on Graph-Theoretic Concepts Comput. Sci. (WG'2006) Revised Papers (2006) 4271(Springer-Verlag, Heidelberg, Germany) 1–14Lecture Notes in Computer ScienceCrossref, Google Scholar
• Bodlaender H. L., Koster A. M. C. A. Treewidth computations I. Upper bounds. (2008) . Technical Report UU-CS-2008-032, Department of Information and Computing Sciences, Utrecht University, Utrecht, The NetherlandsGoogle Scholar
• Bouwman S. A survey of OR models and techniques for electrical grid companies. Proc. 33rd Conf. Math. Oper. Res. (2008) (Landelijk Netwerk Mathematische Besliskunde (LNMB), Lunteren, The Netherlands) Google Scholar
• Feige U., Mahdian M. Finding small balanced separators. Proc. 37th Sympos. Theory Comput. (STOC'2006) (2006) (ACM, New York) 375–384Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman, San Francisco) Google Scholar
• Grigoriev A., Grigorieva N. V. The valve location problem: Minimizing environmental damage of a spill in long oil pipelines. Comput. Indust. Engrg. (2009) 57(3):976–982Crossref, Google Scholar
• Hicks I. V., Koster A. M. C. A., Kolotoğlu E., Smith J. C. Branch and tree decomposition techniques for discrete optimization. TutORials 2005: INFORMS Tutorials in Operations Research Series (2005) (INFORMS, Hanover, MD) 1–29Link, Google Scholar
• Kloks T.Treewidth: Computations and Approximations (1994) 842(Springer-Verlag, Berlin) Lecture Notes in Computer ScienceCrossref, Google Scholar
• Kratsch D., Kloks T., Müller H. Measuring the vulnerability for classes of intersection graphs. Discrete Appl. Math. (1997) 77(3):259–270Crossref, Google Scholar
• Marx D. Parameterized graph separation problems. (2004) 3162(Springer-Verlag, Heidelberg, Germany) 71–82Lecture Notes in Computer ScienceCrossref, Google Scholar
• Ozger S., Mays L. W., Mays L. W. Optimal location of isolation valves: A reliability approach. Water Supply Systems Security (2004) (McGraw Hill, New York) . Chapter 13Google Scholar