摘要:

AbstractThe problem of allocating cost in a spanning tree network is considered. A number of possible schemes are surveyed, and critically analyzed. Methods are suggested that are preferred given different emphases among the criteria for such a function.

ISSN:0028-3045    

DOI:10.1002/net.3230030402

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

年代:1973

数据来源: WILEY

摘要:

AbstractA vehicle shuttles between two terminals, at which passengers are arriving in a Poisson manner at given rates. Travel time between the stops is assumed deterministic. This paper considers the question of what operating strategy will yield lowest average waiting time for passengers of the system. Exact solutions to the problem are obtained, and it is found that the optimal strategy is a somewhat complex but very tractable function of the two Poisson arrival parameters.

ISSN:0028-3045    

DOI:10.1002/net.3230030403

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

年代:1973

数据来源: WILEY

摘要:

AbstractThe notion of an „exact”︁ test for improving network solutions is discussed. Computational results are presented which indicate the power of „exact”︁ tests relative to current marginal pricing schemes. It is conjectured that each cycle in an optimal solution must contain at least\documentclass{article}\pagestyle{empty}\begin{document}$ 1 + \frac{1}{{1^\alpha - 1}} $\end{document}links, where the cost of a link of length l and capacity y is proportional to 1·yα, 0 ≦ α ≦ 1.A simple „exact”︁ test is presented for the one

ISSN:0028-3045    

DOI:10.1002/net.3230030404

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

年代:1973

数据来源: WILEY

摘要:

AbstractThis paper considers the shop scheduling problem which involves both job precedence and machine interference constraints. Based on the graph‐theoretical representation of the problem, a branch‐and‐bound algorithm is proposed for implicitly producing an optimal schedule such that the schedule time is minimized. The algorithm utilizes a set of heuristic rules, in addition to a powerful bounding procedure, to guide the search. An upper bound is also employed to recognize an optimal solution in earlier stages. The procedure is illustrated by a sample problem and its rapid convergence is demonstrated by a set of published problems. The proposed algorithm is compared favorably with existing proce

ISSN:0028-3045    

DOI:10.1002/net.3230030405

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

年代:1973

数据来源: WILEY

摘要:

AbstractTwo conditions for a matrix to be totally unimodular are obtained; one sufficient, one necessary and sufficient. Both conditions involve a directed bipartite graph obtained from a {1, −1, 0}‐valued matrix, and both are generalizations of the fact that directed graphs and 2‐colorable undirected graphs have totally unimodular incidence mat

ISSN:0028-3045    

DOI:10.1002/net.3230030406

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

年代:1973

数据来源: WILEY

摘要:

AbstractThe chromatic reduction problem is to find the minimum number of vertices that have to be eliminated from a graph so that the resultant subgraph has a chromatic number of k. When k = 1, the chromatic reduction problem reduces to finding the maximum internally stable set of a graph. An algorithm is developed for the chromatic reduction problem and computational experience is given.

ISSN:0028-3045    

DOI:10.1002/net.3230030407

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

年代:1973

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230030408

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

年代:1973

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230030409

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

年代:1973

数据来源: WILEY

ISSN:0028-3045    

DOI:10.1002/net.3230030401

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

年代:1973

数据来源: WILEY