摘要:

AbstractA set of points, called consumers, and another point called central supplier, are located in a Euclidean plane. The cost of constructing a connection between two points is proportional to the distance between them. The minimum cost required for connecting all the consumers to the supplier is given by a minimal Steiner tree. An example is given in which for every allocation of the total cost of the tree to the consumers, a coalition of consumers exists, which is charged more than the cost required for connecting its members to the central supplier.

ISSN:0028-3045    

DOI:10.1002/net.3230080104

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

摘要:

AbstractGiven a multigraph G, a sequence (h1,…, hm) of nonnegative integers h1≥… ≥ hmis color‐feasible for G if there is an edge‐coloring H1,…, Hmwhere Hihas exactly hiedges (i=1,…, m). It is known that the set C(G) of color‐feasible sequences of G is partially ordered. We show that if G is simple with maximum degree d, then all maximal sequences of C(G) have at most d+1 nonzero entries. This result can be extended to multigraphs. Furthermore, if the odd elementary cycles of a multigraph G satisfy some specified conditions then all maximal sequences have at most d+

ISSN:0028-3045    

DOI:10.1002/net.3230080105

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

摘要:

AbstractComputation of globally optimal flows in nonlinear gain networks is generally quite difficult. This paper identifies classes of these networks for which optimal solutions are easily obtained.

ISSN:0028-3045    

DOI:10.1002/net.3230080106

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

摘要:

AbstractThis report aims at a comprehensive survey of the literature dealing with the multicommodity flow problem. This problem arises naturally in network modelling wherever commodities, vehicles, or messages are to be shipped or transmitted from certain nodes of an underlying network to some others. Recent applications of mathematical programming techniques to traffic equilibrium problems in transportation studies as well as computer networks analysis has renewed considerable interest in this problem.This report discusses solution techniques for both linear and nonlinear flow problems. The former includes decomposition, partitioning, compact inverse methods, and primal‐dual algorithms. We describe a variety of feasible direction methods for the latter. The report concludes by giving applications and computational experience for both types of problem

ISSN:0028-3045    

DOI:10.1002/net.3230080107

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230080103

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1978

数据来源: WILEY