An evaluation of exact methods for the multiple subset maximum cardinality selection problem

DOI10.1111/BMSP.12068MaRDI QIDQ4614720zbMATH OpenOpenAlexWikidataFDO

Authors Michael J. Brusco, Hans-Friedrich Köhn, Douglas Steinley

Publication date 31 January 2019

Published in British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/bmsp.12068

zbMATH Keywords

item selectioninteger programmingbranch-and-boundsimilarity dataexploratory Mokken scale analysis

Mathematics Subject Classification ID

Measurement and performance in psychology (91E45) Integer programming (90C10) Cardinality properties (cardinal functions and inequalities, discrete subsets) (54A25)

Recommendations

• A branch and bound algorithm for the maximum diversity problem
• Optimization problems with cardinality constraints
• Subset selection for multiple linear regression via optimization
• New bounds for subset selection from conic relaxations
• scientific article; zbMATH DE number 3974711

Cited in

(1)

• Consistent subsets: computationally feasible methods to compute the Houtman-Maks-index

This page was built for publication: An evaluation of exact methods for the multiple subset maximum cardinality selection problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4614720)