ISSN:
1436-4646
Keywords:
Multicommodity network flows
;
Matroids
;
Unimodularity
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A necessary and sufficient condition for unimodularity in the multicommodity transportation problem is established, and the constructive proof yields an equivalent, single commodity network flow problem for the class of problems satisfying the condition. The concept of a graphic matroid is used to establish the transformation.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01584345
Permalink