| Article ID: | iaor20023047 |
| Country: | China |
| Volume: | 22 |
| Issue: | 1 |
| Start Page Number: | 63 |
| End Page Number: | 70 |
| Publication Date: | Mar 2001 |
| Journal: | Journal on Numerical Methods and Computer Applications |
| Authors: | Luo Zongjun |
| Keywords: | programming: integer |
In this paper we discuss an m-dimensional integer bottleneck transportation problem. Theorems for identifying the optimal solutions are given. Additionally, a systematic algorithm is established for finding an optimal solution. Finally, a typical example is presented.