Extracting Maximum Cardinality Subsets
The following files accompany the article "An algorithm for extracting maximum cardinality subsets with perfect dominance or anti-Robinson structure." British Journal of Mathematical and Statistical Psychology, Vol. 60, No. 2, (November, 2007), in press.
Click on a file to view it. Right-click on a file to save it on your computer by choosing "Save Target As...". The download only takes a few seconds and then gives you the option of opening.
For finding subsets with perfect dominance (asymmetric matrices):subset_dominance.m -- MatLab file, requires input matrix "a"
subset_DOM.for -- ForTran file, reads input from AMAT.DAT, which has the size of the matrix as the first number followed by the actual matrix; results/output is stored in SEQ.OUT
For finding subsets with perfect Antirobinson form (symmetric matrices):subset_antirobinson.m -- MatLab file, requires input matrix "a"
subset_AR.for -- ForTran file, reads input from AMAT.DAT, which has the size of the matrix as the first number followed by the actual matrix; results/output is stored in SEQ.OUT
For finding subsets with perfect strongly Antirobinson form (symmetric matrices):subset_stronglyantirobinson.m -- MatLab file, requires input matrix "a"
subset_SAR.for -- ForTran file, reads input from AMAT.DAT, which has the size of the matrix as the first number followed by the actual matrix; results/output is stored in SEQ.OUT
.::Home : Heartist : Optimal Techniques::. |