선거구 획정 문제의 분할정복 알고리즘

논문상세정보
' 선거구 획정 문제의 분할정복 알고리즘' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • adjacency graph
  • divide-and-conquer
  • majority
  • minority
  • rigging elections
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
133 0

0.0%

' 선거구 획정 문제의 분할정복 알고리즘' 의 참고문헌

  • Voting Schemes for Which it can be Difficult to Tell Who Won the Election
    J. Bartholdi Social Choice and Welfare 6 (2) : 157 ~ 166 [1989]
  • United States presidential election
  • Optimal Solutions of Set Covering/Partitioning Problems Using Dual Heuristics
    M. L. Fisher Management Science 36 (6) : 674 ~ 688 [1990]
  • Introduction to the Design and Analysis of Algorithms
    A. V. Levitin Addison Wesley [2002]
  • Introduction to algorithms
    T. H. Cormen MIT Press [1990]
  • Enhancing an Algorithm for Set Covering Problem
    J. E. Beasley European Journal of Operational Research 58 (2) : 293 ~ 300 [1992]
  • Complexity of Computer Computations: Reducibility Among Combinatorial Problems
    R. E. Miller Plenum : 85 ~ 103 [1972]
  • Applications of Optimization with Xpress-MP: 15.3 Rigging Elections
    C. Guéret Dash Optimization Ltd. : 234 ~ 227 [2005]
  • An effective and simple heuristic for the set covering problem
    G. Lan European Journal of Operational Research 176 (3) : 1387 ~ 1403 [2007]
  • An Indirect Genetic Algorithm for Set Covering Problems
    U. Aickelin Journal of the Operational Research Society 53 (10) : 1118 ~ 1126 [2002]
  • An Algorithm for Set Covering Problems
    J. E. Beasley European Journal of Operational Research 31 (1) : 85 ~ 93 [1987]
  • A Genetic Algorithm for the Set Covering Problem
    J. E. Beasley European Journal of Operational Research 94 (2) : 392 ~ 404 [1996]