Some new combinatorial algorithms with appropriate representations of solutions

Combinatorial problems are those problems, whose requirements are an association of some conditions. The construction of efficient algorithms to find solutions of the combinatorial problems is still an interesting matter. In this paper, we choose appropriate representations for desirable solutions...

Full description

Saved in:

Bibliographic Details
Main Authors:	Hoang, Chi Thanh, Nguyen, Quang Thanh
Format:	Article
Language:	English
Published:	H. : ĐHQGHN 2017
Subjects:	combinatorial algorithms representations
Online Access:	http://repository.vnu.edu.vn/handle/VNU_123/56347
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Vietnam National University, Hanoi
Language:	English

id	oai:112.137.131.14:VNU_123-56347
record_format	dspace
spelling	oai:112.137.131.14:VNU_123-563472018-07-20T03:50:21Z Some new combinatorial algorithms with appropriate representations of solutions Hoang, Chi Thanh Nguyen, Quang Thanh combinatorial algorithms representations Combinatorial problems are those problems, whose requirements are an association of some conditions. The construction of efficient algorithms to find solutions of the combinatorial problems is still an interesting matter. In this paper, we choose appropriate representations for desirable solutions of the permutation problem and the partition problem. Then we sort the representations of a problem's solutions in the alphabetical order. Owing to it we construct two new algorithms for quickly finding all solutions of these problems. 2017-08-10T07:46:44Z 2017-08-10T07:46:44Z 2012 Article Hoang, C. T., Nguyen, Q. T. (2012). Some new combinatorial algorithms with appropriate representations of solutions. VNU Journal of Science, Mathematics - Physics Vol. 28, No. 1, 1-10. 2588-1124 http://repository.vnu.edu.vn/handle/VNU_123/56347 en VNU Journal of Science, Mathematics - Physics Vol. 28 application/pdf H. : ĐHQGHN
institution	Vietnam National University, Hanoi
building	VNU Library & Information Center
country	Vietnam
collection	VNU Digital Repository
language	English
topic	combinatorial algorithms representations
spellingShingle	combinatorial algorithms representations Hoang, Chi Thanh Nguyen, Quang Thanh Some new combinatorial algorithms with appropriate representations of solutions
description	Combinatorial problems are those problems, whose requirements are an association of some conditions. The construction of efficient algorithms to find solutions of the combinatorial problems is still an interesting matter. In this paper, we choose appropriate representations for desirable solutions of the permutation problem and the partition problem. Then we sort the representations of a problem's solutions in the alphabetical order. Owing to it we construct two new algorithms for quickly finding all solutions of these problems.
format	Article
author	Hoang, Chi Thanh Nguyen, Quang Thanh
author_facet	Hoang, Chi Thanh Nguyen, Quang Thanh
author_sort	Hoang, Chi Thanh
title	Some new combinatorial algorithms with appropriate representations of solutions
title_short	Some new combinatorial algorithms with appropriate representations of solutions
title_full	Some new combinatorial algorithms with appropriate representations of solutions
title_fullStr	Some new combinatorial algorithms with appropriate representations of solutions
title_full_unstemmed	Some new combinatorial algorithms with appropriate representations of solutions
title_sort	some new combinatorial algorithms with appropriate representations of solutions
publisher	H. : ĐHQGHN
publishDate	2017
url	http://repository.vnu.edu.vn/handle/VNU_123/56347
_version_	1680966291479855104

Some new combinatorial algorithms with appropriate representations of solutions

Similar Items