logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A heuristic algorithm for the equitable partitioning problem

delete1997-04-01
delete11
PRE
AI
F
Frances A. O’Brien *
J
John Mingers
DOI：10.1016/S0305-0483(96)00046-1delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This paper describes a heuristic for the equitable partitioning problem, which involves classifying individual elements, so that classes are similar. The paper presents three extensions to a heuristic algorithm, developed in earlier work, which dealt with binary-valued attributes only, The first extension illustrates how changing the coding of the data without changing the problem improves the quality of solutions obtained. The second extension allows the algorithm to deal with different scales of measurement; data sets consisting of binary valued, multi-valued nominal and interval attributes are tested and the results presented, The third extension allows the algorithm to deal with problems involving classes of different sizes. The revised heuristic is applied to the real life problem of allocating university student accommodation. (C) 1997 Elsevier Science Ltd.
Keywords:
classification
combinatorial optimization
heuristics
information theory
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

O
Omega-International Journal of Management Science
IF:
7.2
Papers:
3.7K
Citations:
1.4W

Organization

No organization information available