Implementation of the Distributed Fixed-Point Algorithm and Its Application
A implementation of the distributed Dang and Ye’s fixed-point algorithm, which is a new alternative algorithm for integer programming, is developed in this paper. This fixed-point algorithm is derived from an increasing mapping which satisfies certain properties. A classical problem, which is called market split problem, has been solved by this distributed implementation. It is shown that this implementation is effective in numerical results. Besides, it can be used to other similar integer problems.
KeywordsFixed-point algorithm Increasing mapping Integer programming Market split problem
The authors are very grateful to the reviewers for their valuable suggestions and comments. This work was partially supported by National Nature Science Foundation of China under grants 71471091 and 71271119, Research Foundation of USTS under grants No. XKQ201517.
- 1.Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. WH Freeman & Co., San Francisco (1979)Google Scholar
- 6.Dang, C.: An increasing-mapping approach to integer programming based on lexicographic ordering and linear programming. In: The Ninth International Symposium on Operations Research and Its Applications, Chengdu-jiuzhaigou, China (2010)Google Scholar
- 9.Message Passing Interface Forum: MPI: A message-passing interfacestandard, version 2.2 (2009). http://www.mpiforum.org/docs/mpi-2.2/mpi22-report.pdf
- 10.Cornuéjols, G., Dawande, M.: A class of hard small 01 programs. In: Integer Programming and Combinatorial Optimization, pp. 284–293 (1998)Google Scholar
- 12.Wu, Z., Dang, C., Zhu, C.: Solving the market split problem using a distributed computation approach. In: IEEE International Conference on Information and Automation, Yinchuan, China, pp. 1252–1257 (2013)Google Scholar