Results 201 to 210 of about 25,776 (266)

A Branch-and-Bound Algorithm for Pagination

Operations Research, 1975
The paper presents an algorithm for partitioning the nodes of a weighted graph in order to minimize the interset weights. The algorithm is patterned after the branch-and-probabilistic-bound procedures of Graves and Whinston. Final partitions or solutions are characterized by probability statements like: “the probability is greater than α that a ...
John Duncan, Lawrence W. Scott
openaire   +2 more sources

A Branch and Bound Clustering Algorithm

IEEE Transactions on Computers, 1975
The problem of clustering N objects into M classes may be viewed as a combinatorial optimization algorithm. In the literature on clustering, iterative hill-climbing techniques are used to find a locally optimum classification. In this paper, we develop a clustering algorithm based on the branch and bound method of combinatorial optimization.
Warren L. G. Koontz   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy