DocumentCode
2141374
Title
A sequential delimitative and combinatorial algorithm for a class of integer programming
Author
Shi Lian-shuan ; Chai Shan ; Lin, Da
Author_Institution
Comput. Dept., Tianjin Vocational Tech. Teacher Coll., China
fYear
2003
fDate
27-29 Aug. 2003
Firstpage
801
Lastpage
804
Abstract
The algorithm was given for solving a class of integer programming problems, this algorithm generates all combinations according to a certain order of the magnitude of objective function by using a multilevel generating method of preceding for higher place. In the procedure of generating combinations, the algorithm eliminates a majority of infeasible and nonoptimum combinations by using sequential delimitative and combinatorial method so that the algorithm has a higher computational efficiency.
Keywords
combinatorial mathematics; computational complexity; integer programming; linear programming; combination generation; computational efficiency; integer programming; objective function; sequential delimitative combinatorial algorithm; Algorithm design and analysis; Combinatorial mathematics; Computational efficiency; Educational institutions; Influenza; Linear programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on
Print_ISBN
0-7803-7840-7
Type
conf
DOI
10.1109/PDCAT.2003.1236418
Filename
1236418
Link To Document