Chapter 10
Network Design Problems: Models and Applications
10.1. Introduction
In Chapter 9, we introduced the conceptual basis of network design problems, and we illustrated this with the help of a generic model:
Sample problem CFA: capacitated flow assignment.
{Find, on an initial network G = (X,E), which defines a support topology, an infrastructure vector z ≥ 0 ∈ Z and a multiflow f = (fi i in I) ≥ 0 such that:
Zmin = U(z) (installation cost) + V(z,f) (operational cost linked to y) + W(z,f) (measure of service failure associated with y) is the smallest possible.}
We then proposed a taxonomy of network design problems, based on the fact that:
Get Applications of Combinatorial Optimization, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.