| Article ID: | iaor2006660 |
| Country: | United Kingdom |
| Volume: | 32 |
| Issue: | 8 |
| Start Page Number: | 1953 |
| End Page Number: | 1981 |
| Publication Date: | Aug 2005 |
| Journal: | Computers and Operations Research |
| Authors: | Pardalos Panos M., Oliveira Carlos A.S. |
| Keywords: | communication, networks, optimization |
In multicasting routing, the main objective is to send data from one or more sources to multiple destinations, while at the same time minimizing the usage of resources. Examples of resources which can be minimized include bandwith, time and connection costs. In this paper, we survey applications of combinatorial optimization to multicasting routing. We discuss the most important problems considered in this area, as well as their models. Algorithms for each of the main problems are also presented.