Network Algorithms for Planning

This chapter contains sections titled:

• Introduction

• The Terminal Assignment Problem

• The Concentrator Location Problem

• Minimum Weight Spanning Trees

• Distributed Network Topological Design

• Routing with Economies of Scale

• Shortest Path Routing

• Problems

]]>