Mizutani, Tomohiko; Yamashita, Makoto - In: Journal of Global Optimization 56 (2013) 3, pp. 1073-1100
We present a hierarchy of semidefinite programming (SDP) relaxations for solving the concave cost transportation problem (CCTP), which is known to be NP-hard, with p suppliers and q demanders. In particular, we study cases in which the cost function is quadratic or square-root concave. The key...