2007
DOI: 10.1016/j.tcs.2007.01.023
|View full text |Cite
|
Sign up to set email alerts
|

Breaking the search space symmetry in partitioning problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…Finally, array eval contains components of fitness function for that chromosome. Similar structure was successfully used in [10].…”
Section: A Single Chromosomementioning
confidence: 99%
“…Finally, array eval contains components of fitness function for that chromosome. Similar structure was successfully used in [10].…”
Section: A Single Chromosomementioning
confidence: 99%
“…with the Hungarian algorithm [Kühn, 1955]). A complete description of this methodology is available [Gusfield, 2002] and it is used by all recent studies ( [Charon et al, 2006;da Costa and Rao, 2004;Cardoso and Corte-Real, 2005;Talbi and Weinberg, 2007]) dealing with partition distances.…”
Section: Context and Related Studiesmentioning
confidence: 99%