论文信息 - A branch and bound algorithm for the capacitated minimum spanning tree problem

A branch and bound algorithm for the capacitated minimum spanning tree problem

Given an undirected graph G = (N, E) with a cost associated with each edge C: E → R+ and a demand associated with each node A: N → R+. A special node is designated as the center. The capacitated minimum spanning tree (CMST) problem is to find a minimum spanning tree for graph G such that the sum of demands on each branch stem from the center does not exceed a given capacity. The CMST problem has many applications in network design, centralized telecommunications, and vehicle routing. In this paper, we present a new formulation and a full optimization algorithm by branch and bound. The lower bounds are generated by Lagrangean relaxation with tightening constraints. Computational results based upon the methodology presented are shown. © 1993 by John Wiley & Sons, Inc.

Kavindra Malik | Gang Yu

[1] K. Mani Chandy,et al. The Design or Multipoint Linkages in a Teleprocessing Tree Network , 1972, IEEE Transactions on Computers.

[2] Bezalel Gavish,et al. Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem , 1983, JACM.

[3] Bezalel Gavish,et al. Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[4] Christos H. Papadimitriou,et al. The complexity of the capacitated tree problem , 1978, Networks.

[5] Aaron Kershenbaum,et al. Computing capacitated minimal spanning trees efficiently , 1974, Networks.

[6] K. Mani Chandy,et al. The Capacitated Minimum Spanning Tree , 1973, Networks.

[7] Aaron Kershenbaum,et al. Centralized teleprocessing network design , 1976, Networks.

[8] Egon Balas,et al. A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[9] M. Ferguson,et al. Topological Design of Multipoint Teleprocessing Networks , 1974, IEEE Trans. Commun..