Metric Inequalities for Routings on Direct Connections
Please always quote using this URN: urn:nbn:de:0297-zib-44219
- We consider multi-commodity flow problems in which capacities are installed on paths. In this setting, it is often important to distinguish between flows on direct connection routes, using single paths, and flows that include path switching. We show that the concept of metric inequalities to characterize capacities that support a multi-commodity flow can be generalized to deal with direct connections.
Download full text files
Additional Services
| Author: | Ralf BorndörferORCiD, Marika Karbstein |
|---|---|
| Document Type: | ZIB-Report |
| Tag: | direct connection; metric inequalities; multi-commodity flow problem |
| MSC-Classification: | 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C10 Integer programming |
| 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization | |
| Date of first Publication: | 2014/02/18 |
| Series (Serial Number): | ZIB-Report (14-04) |
| ISSN: | 1438-0064 |
