Design and Analysis of Cards-Flipping Algorithm

Article Preview

Abstract:

This paper discusses a new algorithm solving zero-one integer linear programming models. Based on the analysis of different commonly used algorithms, we put forward a new algorithm named cards-flipping algorithm which demonstrate reliability and accuracy equivalent to enumeration methods. The correctness and practicability of the method are verified with mathematical proofs and a great deal of examples.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 468-471)

Pages:

448-451

Citation:

Online since:

February 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] D.S. Cheng, S.N. Zhang: Journal of Jiangxi Vocational and Technical College of Electricity.Vol.19 (2006), p.31

Google Scholar

[2] R.E. Bixby, S. Ceria, C.M. McZeal, M.W.P. Savelsbergh. An updated mixed integer programming library MIPLIB 3.0[N]. Optima 58. Florida:MOS,1998. 12–15.

Google Scholar

[3] D. Connolly. Journal of the Operational Research Society. Vol.43(1992), p.495

Google Scholar

[4] Y.Q.Hu , in: Operational Research Textbook. edited by Tsinghua University Press(1998), p.128

Google Scholar

[5] N.Zhao: Journal of Shanghai Maritime University. Vol.1(2011), p.8

Google Scholar