Half-quadratic transportation problems
Optimization and Control
2017-05-30 v1 Data Structures and Algorithms
Abstract
We present a primal--dual memory efficient algorithm for solving a relaxed version of the general transportation problem. Our approach approximates the original cost function with a differentiable one that is solved as a sequence of weighted quadratic transportation problems. The new formulation allows us to solve differentiable, non-- convex transportation problems.
Cite
@article{arxiv.1705.09789,
title = {Half-quadratic transportation problems},
author = {Mariano Rivera},
journal= {arXiv preprint arXiv:1705.09789},
year = {2017}
}