Laplace's Equation and Network Flows

T. C. Hu
Additional contact information
T. C. Hu: University of Wisconsin, Madison, Wisconsin

Operations Research, 1967, vol. 15, issue 2, 348-356

Abstract: This paper shows that the problem of Laplace's equation can be formulated as a minimum cost network flow problem with quadratic cost. Then an algorithm for solving quadratic cost network flow problems can be modified to solve the standard Laplace's equation.

Date: 1967
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.2.348 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:15:y:1967:i:2:p:348-356

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().