摘要
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.
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.
