{"id":"W2041781650","doi":"10.1007/s10589-007-9126-9","title":"Algorithm for cardinality-constrained quadratic optimization","year":2007,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":255,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic programming; Cardinality (data modeling); Mathematical optimization; Solver; Selection (genetic algorithm); Branch and bound; Quadratic equation; Optimization problem; Integer programming; Limit (mathematics); Integer (computer science); Computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001990587,0.0002012985,0.0002762295,0.0004335996,0.0006297922,0.000336089,0.0002614763,0.0001262517,0.0001200774],"category_scores_gemma":[0.0003112982,0.0001901526,0.0001128534,0.00119265,0.0001657432,0.0004233154,0.0000451614,0.00008535473,0.00002060676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004758851,"about_ca_system_score_gemma":0.000123681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005282716,"about_ca_topic_score_gemma":0.000002931895,"domain_scores_codex":[0.9974298,0.0000734539,0.0009779282,0.000586645,0.0006660718,0.0002660671],"domain_scores_gemma":[0.9963371,0.001402325,0.0004204691,0.0002986164,0.001328769,0.0002127837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008707399,0.00005032348,0.0002015766,0.000002398249,0.00001356594,2.585179e-7,0.00007260362,0.8306187,0.00000180233,0.02335734,0.0003326985,0.14534],"study_design_scores_gemma":[0.0006421173,0.000036351,0.0004363952,0.000004355396,0.00003042093,0.00001557337,0.0003195394,0.9633324,0.00001321632,0.02470819,0.01024663,0.0002148782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007344229,0.0001152636,0.9947697,0.0006580824,0.0001250182,0.001177746,0.0001028332,0.000113657,0.002864277],"genre_scores_gemma":[0.03300549,0.00008711335,0.9644405,0.0004759874,0.0002678416,0.0002277206,0.0009003656,0.00002704609,0.0005678891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1451251,"threshold_uncertainty_score":0.7754198,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04823591415135936,"score_gpt":0.3753824978427202,"score_spread":0.3271465836913608,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}