Advertisement

Implementation of the Distributed Fixed-Point Algorithm and Its Application

  • Zhengtian WuEmail author
  • Qinfen Shi
  • Yu Yu
  • Haili Xia
  • Hongyan Yang
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 660)

Abstract

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.

Keywords

Fixed-point algorithm Increasing mapping Integer programming Market split problem 

Notes

Acknowledgment

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.

References

  1. 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
  2. 2.
    Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64(5), 275–278 (1958)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica: J. Econometric Soc. 28, 497–520 (1960)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Scarf, H.E.: Neighborhood systems for production sets with indivisibilities. Econometrica: J. Econometric Soc. 54, 507–532 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Jünger, M., Liebling, T., Naddef, D., Nemhauser, G., Pulleyblank, W., Rerhard, G., Rinaldi, G., Wolsey, L.: 50 Years of Integer Programming 1958–2008. Springer, Berlin (2010)CrossRefzbMATHGoogle Scholar
  6. 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
  7. 7.
    Dang, C., Ye, Y.: A fixed point iterative approach to integer programming and its distributed computation. Fixed Point Theor. Appl. 2015(1), 1–15 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1998)zbMATHGoogle Scholar
  9. 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. 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
  11. 11.
    Aardal, K., Bixby, R.E., Hurkens, C.A., Lenstra, A.K., Smeltink, J.W.: Market split and basis reduction: towards a solution of the Cornuéjols-Dawande instances. INFORMS J. Comput. 12(3), 192–202 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 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

Copyright information

© Springer Nature Singapore Pte Ltd. 2016

Authors and Affiliations

  • Zhengtian Wu
    • 1
    Email author
  • Qinfen Shi
    • 1
  • Yu Yu
    • 2
  • Haili Xia
    • 1
  • Hongyan Yang
    • 1
  1. 1.Suzhou University of Science and TechnologySuzhouChina
  2. 2.Nanjing Audit UniversityNanjingChina

Personalised recommendations