본문 바로가기
  • Home

Variable Ordering Algorithms Using Problem Classifying Rule

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2011, 16(4), pp.129-138
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

손석원 1

1호서대학교

Accredited

ABSTRACT

Efficient ordering of decision variables is one of the methods that find solutions quickly in the depth first search using backtracking. At this time, development of variables ordering algorithms considering dynamic and static properties of the problems is very important. However, to exploit optimal variable ordering algorithms appropriate to the problems. In this paper, we propose a problem classifying rule which provides problem type based on variables' properties, and use this rule to predict optimal type of variable ordering algorithms. We choose frequency allocation problem as a DS-type whose decision variables have dynamic and static properties, and estimate optimal variable ordering algorithm. We also show the usefulness of problem classifying rule by applying base station problem as a special case whose problem type is not generated from the presented rule.

Citation status

* References for papers published after 2023 are currently being built.