摘要:

AbstractA bit manipulation method is given for finding shortest distances from an origin in an unweighted graph, or alternatively, for finding connected components. The basic approach is similar to some component algorithms already in the literature but an easy implementation is given that overcomes the problem which prevents the others from being efficient–namely, the problem of identifying the ones in a sparse bit string without checking all the bits. The algorithm would be most effective for moderate sized graphs (about 20–100 nodes). Computational results are gi

ISSN:0028-3045    

DOI:10.1002/net.3230050402

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

年代:1975

数据来源: WILEY

摘要:

AbstractA special regulation and tracking control strategy for large‐order nonlinear networks is introduced. A theorem useful for implementing this strategy and its application to several examples, including a well‐known transient power‐network model, are

ISSN:0028-3045    

DOI:10.1002/net.3230050403

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

年代:1975

数据来源: WILEY

摘要:

AbstractThis paper develops an algorithm for handling nonlinear minimum‐cost multicommodity flow problems and applies it to a specific large‐scale network. The commodities will be imports and exports; the cost functions will be quadratic and convex. The setting will be a Port Planning Model which will seek to find optimal simultaneous routings through the network while fulfilling requirements both at foreign ports and at domestic hinterlands. The computer program written solves such a problem. The algorithm involves linearizing the cost function and solving the resulting linear program, which is, in fact, a series of shortest route problems. Negative cycles are studied in de

ISSN:0028-3045    

DOI:10.1002/net.3230050404

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

年代:1975

数据来源: WILEY

摘要:

AbstractThis paper is concerned with an integer programming characterization of a cut in a network. This characterization provides a fundamental equivalence between directed pseudosymmetric networks and undirected networks. It also identifies a class of problems which can be solved as minimum cut problems on a network.

ISSN:0028-3045    

DOI:10.1002/net.3230050405

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

年代:1975

数据来源: WILEY

摘要:

AbstractConditions are developed which relate the existence of negative and nonpositive simple cycles in an undirected network to minimal complete matchings on a derived network. These conditions are then used to develop a test to determine whether or not an undirected network contains nonpositive simple cycles. Also, it is shown that, in certain cases, the solution to the matching problem gives information about the location of the nonpositive cycles.

ISSN:0028-3045    

DOI:10.1002/net.3230050406

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

年代:1975

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230050401

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

年代:1975

数据来源: WILEY