G. Diehr, “Evaluation of a Branch-and-Bound Algorithm for Clustering,” SIAM Journal on Scientific and Statistical Computing, Vol. 6, No. 2, April 1985, pp. 268-284.

has been cited by the following article:

• TITLE: Service Networks Topological Design

  AUTHORS: Boris S. Verkhovsky

  KEYWORDS: Delivery/Processing Cost, Binary Partitioning, Dynamic Programming, First Responders, Average Complexity, Service Provider, Water Desalination

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.3 No.11, November 23, 2010

  ABSTRACT: Topological design of service networks is studied in the paper. Quantitative model and algorithm minimizing cost of processing and delivery is described. Algorithm solving combinatorial problem of optimal design based on binary partitioning, a parametric search and dynamic programming optimization of a binary tree is described and demonstrated in numeric example.