A DELIVERY PROBLEM.

Abstract

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)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1965
Accession Number
AD0621581

Entities

People

  • Marie-claude Roubault

Organizations

  • University of California, Los Angeles

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Inequalities
  • Sequences

Readers

  • Electrical Engineering
  • Graph Algorithms and Convex Optimization.
  • Regression Analysis.