Coflow in the traveling preacher problem
Kathie Cameron, Jennifer Edmonds · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1994
For a directed graph G with given (integer) costs on the edges and (integer) sin on the nodes, {open_quotes}a fair assessment{close_quotes} is an assessment of (integer) charges to the nodes, no less than their sin, such that, for each directed circuit C in G, the sum of charges in C is at most the sum of costs in C. For any given linear objective function of assessments, we find easily, if there is one, a fair assessment which maximizes.