| Article ID: | iaor20002211 |
| Country: | Germany |
| Volume: | 50 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 7 |
| Publication Date: | Jan 1999 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Burkard R.E., Meusel S.G. |
| Keywords: | programming: transportation |
This paper deals with transportation problems whose demand vectors can be permuted. This additional freedom makes these problems