摘要:

AbstractThis paper presents extensive computational experience with a special purpose primal simplex algorithm. The performance is compared to that of several “state of the art” out‐of‐kilter computer codes. The computational characteristics of several different primal feasible start procedures and pivot selection strategies are also examined.The study discloses the advantages, in both computation time and memory requirements, of the primal approach over the out‐of‐kilter method. The test environment has the following distinguishing properties: (1) all of the codes are tested on the same machine and the same problems, (2) the test set includes capacitated and uncapacitated transhipment networks, transportation problems, and assignment problems, and (3) problem sizes ranging from 200 to 8,000 nodes with up to 35,000 arcs a

ISSN:0028-3045    

DOI:10.1002/net.3230040302

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

年代:1974

数据来源: WILEY

摘要:

AbstractThe ARPA Computer Network, which today links over 60 host computers in more than 40 different locations is a significant advance both in computer systems and data communications. The ARPANET uses a communication technique called packet switching to dynamically select message routes through the network. In this paper, we discuss a number of important properties of the network as well as the techniques used to identify these properties. Among the topics discussed are ARPANET growth, performance sensitivity to traffic variations, incremental costs for adding capacity and new sites, peak throughput costs, and network reliability.

ISSN:0028-3045    

DOI:10.1002/net.3230040303

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

年代:1974

数据来源: WILEY

摘要:

AbstractThe shortest path problem is well known and a number of methods have been proposed for its solution. In its simplest form no restrictions or special costs are placed on movement in the network. Some variations of the problem have been presented and solved, such as requirements for visiting specified nodes, turn penalties and prohibitions and time‐dependent length of arcs. In this paper we present and solve the case where we seek the shortest path when some arcs are closed for travelling during specified periods of time. We allow parking in the vertices of the network, when it is necessary to wait for an arc to be opened, but we also assume the possibility of “no‐parking” or “occupied” periods in the nodes. This type of problem emerges, for example, in the management of railway system, or a network of narrow roads with convoys m

ISSN:0028-3045    

DOI:10.1002/net.3230040304

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

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper modifies Ford and Fulkerson's Maximum Dynamic Flow Algorithm so that additional arcs can be added to or deleted from the network at a later time period.

ISSN:0028-3045    

DOI:10.1002/net.3230040305

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

年代:1974

数据来源: WILEY

摘要:

AbstractThis paper presents an algorithm for finding maximal sized sets of flows in a certain class of multicommodity flow networks. The class consists of networks with integer capacity edges and with each node being a source or sink for all but at most one commodity. This new procedure lifts a restriction in a previous algorithm that required flow in edges joining source and sink of the same commodity.

ISSN:0028-3045    

DOI:10.1002/net.3230040306

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

年代:1974

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230040307

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

年代:1974

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230040308

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

年代:1974

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230040301

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

年代:1974

数据来源: WILEY