Bandwidth Issues White Papers
A Column-Generation and Branch-and-Cut Approach to the Bandwidth-Packing Problem
Overview The bandwidth-packing problem is a combinatorial optimization problem arising from telecommunication networks where demand exceeds capacity and where point-to-point calls with varying bandwidths are routed on this network such that each call uses a single path. These problems occur within ATM technology and when video data is routed. It belongs to the broad class of multi-commodity flow problems that are commonly associated with communication, computer, transportation, and distribution network applications. Calls between pairs of nodes define the commodities, and links connecting nodes represent transmission lines in the telecomm network.
| Publisher | George Mason University | File Format | |
|---|---|---|---|
| Date Published | March 2006 | ||
| Format | White Papers | ||
| Topics | |||



