Article ID: | iaor2014851 |
Volume: | 8 |
Issue: | 5 |
Start Page Number: | 1619 |
End Page Number: | 1635 |
Publication Date: | Jun 2014 |
Journal: | Optimization Letters |
Authors: | Poss Michael |
Keywords: | vehicle routing & scheduling |
Designing a network able to route a set of non‐simultaneous demand vectors is an important problem arising in telecommunications. In this paper, we compare the optimal capacity allocation costs for six routing sets: affine routing, volume routing and its two simplifications, the routing based on an unrestricted 2‐cover of the uncertainty set, and the routing based on a cover delimited by a hyperplane.