A DELIVERY PROBLEM.
CALIFORNIA UNIV LOS ANGELES NUMERICAL ANALYSIS RESEARCH
Pagination or Media Count:
Let there be given a graph from which is to be extracted a certain forest F which contains every node s and is such that on each node certain given inequalities, depending on s and F, are satisfied. The procedure proposed consists in building a sequency of forests containing every node and such that all the required constraints are satisfied for the last element of the sequence. This problem is an abstract version of the problem of efficient delivery of electrical power in a geographically extended network. Author