ISSN:
1432-5217
Keywords:
Key words: Transportation problems
;
permuted demand vector
;
computational complexity
;
Monge property
;
solution procedure
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract. This paper deals with transportation problems whose demand vectors can be permuted. This additional freedom makes these problems ??-hard, even in the case that the cost matrix fulfills a Monge property. We outline some solution procedures based on good lower and upper bounds.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/s001860050030
Permalink