Reduction of Potential-Based Flow Networks

References

• [1] Andoni A, Gupta A, Krauthgamer R (2014) Toward (1+ε)-approximate flow sparsifiers. Chekuri C, ed. Proc. 25th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 279–293.Google Scholar
• [2] Bertsekas D (1999) Nonlinear Programming (Athena Scientific, Belmont, MA).Google Scholar
• [3] Bienstock D, Verma A (2010) The n – k problem in power grids: New models, formulations, and numerical experiments. SIAM J. Optim. 20(5):2352–2380.Crossref, Google Scholar
• [4] Birkhoff G, Diaz JB (1956) Non-linear network problems. Quart. Appl. Math. 13(4):431–443.Crossref, Google Scholar
• [5] Calvert B, Keady G (1993) Braess’s paradox and power-law nonlinearities in networks. ANZIAM J. 35(1):1–22.Google Scholar
• [6] Chandra AK, Raghavan P, Ruzzo WL, Smolensky R, Tiwari P (1996) The electrical resistance of a graph captures its commute and cover times. Comput. Complexity 6(4):312–340.Crossref, Google Scholar
• [7] Chaudhuri S, Subrahmanyam K, Wagner F, Zaroliagis CD (2000) Computing mimicking networks. Algorithmica 26(1):31–49.Crossref, Google Scholar
• [8] Collins M, Cooper L, Helgason R, Kennington J, LeBlanc L (1978) Solving the pipe network analysis problem using optimization techniques. Management Sci. 24(7):747–760.Link, Google Scholar
• [9] Coste M (2000) An introduction to semialgebraic geometry. Dottorato di Ricerca in Matematica, Istituti Editoriali e Poligrafici Internazionali, Pisa, Italy.Google Scholar
• [10] Danskin JM (1976) The Theory of Max-Min and Its Application to Weapons Allocation Problems (Springer, Berlin/Heidelberg).Google Scholar
• [11] Dorfler F, Bullo F (2012) Kron reduction of graphs with applications to electrical networks. IEEE Trans. Circuits Systems I Regular Papers 60(1):150–163.Crossref, Google Scholar
• [12] Fiacco AV, ed. (1983) Introduction to Sensitivity and Stability Analysis in Nonlinear Programming, Mathematics in Science and Engineering, vol. 165 (Academic Press, New York).Google Scholar
• [13] Ghosh A, Boyd S, Saberi A (2008) Minimizing effective resistance of a graph. SIAM Rev. 50(1):37–66.Crossref, Google Scholar
• [14] Groß M, Pfetsch ME, Schewe L, Schmidt M, Skutella M (2019) Algorithmic results for potential-based flows: Easy and hard cases. Networks 73(3):306–324.Crossref, Google Scholar
• [15] Hagerup T, Katajainen J, Nishimura N, Ragde P (1998) Characterizing multiterminal flow networks and computing flows in networks of small treewidth. J. Comput. System Sci. 57(3):366–375.Crossref, Google Scholar
• [16] Hendrickson CT, Janson BN (1984) A common network flow formulation for several civil engineering problems. Civil Engrg. Systems 1(4):195–203.Crossref, Google Scholar
• [17] Kanniappan P, Sastry SM (1983) Uniform convergence of convex optimization problems. J. Math. Anal. Appl. 96(1):1–12.Crossref, Google Scholar
• [18] Klein DJ, Randić M (1993) Resistance distance. J. Math. Chemistry 12(1):81–95.Crossref, Google Scholar
• [19] Krauthgamer R, Rika I (2013) Mimicking networks and succinct representations of terminal cuts. Khanna S, ed. Proc. 24th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 1789–1799.Google Scholar
• [20] Kron G (1939) Tensor Analysis of Networks (J. Wiley & Sons, New York).Google Scholar
• [21] Maugis J (1977) Etude de réseaux de transport et de distribution de fluide. RAIRO Oper. Res. 11(2):243–248.Crossref, Google Scholar
• [22] Rockafellar RT (1984) Network Flows and Monotropic Optimization (Athena Scientific, Belmont, MA).Google Scholar
• [23] Saksena N (2002) The Dirichlet problem for infinite networks. Technical report, REU Mathematics Project, University of Washington. Retrieved https://sites.math.washington.edu/∼reu/papers/2002/saksena/saksena.pdf.Google Scholar
• [24] Sauer PW (1981) On the formulation of power distribution factors for linear load flow methods. IEEE Trans. Power Apparatus Systems 100(2):764–770.Crossref, Google Scholar