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...
Saved in:
Main Authors: | Hoang, Chi Thanh, Nguyen, Quang Thanh |
---|---|
Format: | Article |
Language: | English |
Published: |
H. : ĐHQGHN
2017
|
Subjects: | |
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 |
Similar Items
-
On combinatorial designs
by: Cabral, Kylie Ivet, et al.
Published: (2009) -
On combinatorial designs
by: Cabral, Kylie Ivet, et al.
Published: (2009) -
Combinatorial arguments in computing higher derivatives of inverses
by: Del Mundo, Shangrila Danielle B., et al.
Published: (2005) -
Hybrid positive and negative correlation learning in estimation of distribution algorithm for combinatorial optimization problems
by: Warin Wattanapornprom
Published: (2012) -
A combinatorial identity with application to estimation
by: Padua, Roberto N., et al.
Published: (1986)