| Article ID: | iaor1995805 |
| Country: | Poland |
| Volume: | 19 |
| Issue: | 2 |
| Start Page Number: | 69 |
| End Page Number: | 81 |
| Publication Date: | Apr 1993 |
| Journal: | Systems Science |
| Authors: | Kasprzak Andrzej |
| Keywords: | computers |
The paper presents the exact algorithm for a capacity and flow assignment problem. The problem consists in the selection of flow routes and the channel capacities in order to minimize the total average delay per packet in a computer communication network subject to budget constraint. The branch and bound method is used to construct the exact algorithm.