Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem-Reference-Cited by-同舟云学术

Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem

Published:1983-01 Issue:1 Volume:30 Page:118-132
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Gavish Bezalel¹

Affiliation:

1. Graduate School of Management, University of Rochester, Rochester, NY

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference24 articles.

1. BENDERS J.F Partmomng procedures for solving mixed-variables programming problems Numer. ische Math. 4 (1962) 238-252. BENDERS J.F Partmomng procedures for solving mixed-variables programming problems Numer. ische Math. 4 (1962) 238-252.

2. The capacttated muumum spanning tree;ANI Lo, T;Networks,1973

3. PThe decomposition algorithm for linear programming;DA TZIG;Econometrica,1961

4. A note on two problems m connection with graphs;DIJKSTRA E W;Numerische Math.,1959

5. Topological design of mulUpoint teleprocessmg networks;ELIAS D.;IEEE Trans. Commun. COM-22 (197#)

Cited by 119 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Ordered Median Tree Location Problem;Computers & Operations Research;2024-09

2. A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem;Computers & Operations Research;2022-08

3. Design of capacitated degree constrained min-sum arborescence;OPSEARCH;2022-06-27

4. Data extraction in network through Rendezvous Point network;RECENT TRENDS IN SCIENCE AND ENGINEERING;2022

5. A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks;INFORMS Journal on Computing;2021-02-12