Service Networks Topological Design

Abstract

Topological design of service networks is studied in the paper. A quantitative model and algorithm minimizing cost of processing and delivery are described. An algorithm solving combinatorial problem of optimal design based on binary partitioning, a parametric search and dynamic programming optimization of a binary tree are described and demonstrated in numeric examples.