 |
|||||||||
| Volume 2, Number 2, May 2006, pp. 327-339 | |||||||||
| Hiroshi Konno and Takaaki Egawa | |||||||||
| Key words: | |||||||||
| concave minimization, transportation problem, integer programming, piecewise linear approximation | |||||||||
| Mathematices Subject Classification: 65K05, 90B06, 90C06, 90C10, 90C26, 90C27, 90C59 | |||||||||
|
||||||||||||||||||||||||||||||||||||||||
| Abstract: | |||
| This paper is concerned with computational studies on classical and very difficult concave cost transportation problems. We apply successive piecewise linear approximation scheme by introducing zero-one integer variables. We will show that an approximately optimal solution is obtained within a practical amount of time for problems up to 100 concave source nodes using various types of data. This is a significant improvement over the past computational studies on the same problem, where the largest problem solved is up to several concave nodes. | |||
| Computational studies on large scale concave cost transportation problems | ||
| Special Issue of ICOTA6 | ||