Design and Analysis on Greedy Algorithm Based on Distribution Center Location
For the problem of distribution center location about 0-1 mixed integer programming, the necessary and sufficient conditions for the solvable model are given. A heuristic algorithm is designed with the idea of the greedy algorithm by further combined the model characteristics. It is proved that the algorithm could quickly converge to satisfactory solution, and the algorithm is bounded by polynomial time, and the complexity of the algorithm is given.
C. Liu "Design and Analysis on Greedy Algorithm Based on Distribution Center Location", Advanced Materials Research, Vols. 314-316, pp. 2100-2104, 2011