{"id":"W2082030917","doi":"10.1287/ijoc.13.3.210.12632","title":"Fast Heuristics for the Maximum Feasible Subsystem Problem","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematical optimization; Cardinality (data modeling); Computer science; Set (abstract data type); Linear programming; Mathematics; Algorithm; Data mining","routes":{"ca_aff":true,"ca_fund":true,"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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001276326,0.0002034212,0.0002200436,0.0001692086,0.00134324,0.001039935,0.001592379,0.00005815029,0.000005837921],"category_scores_gemma":[0.00008317745,0.000127091,0.0002162887,0.0005340611,0.00005406937,0.000453427,0.0002699071,0.0005200314,0.00003258222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007282432,"about_ca_system_score_gemma":0.00009814614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000664011,"about_ca_topic_score_gemma":0.000004280385,"domain_scores_codex":[0.9981299,0.00003195104,0.000590672,0.0002111869,0.000482143,0.0005541563],"domain_scores_gemma":[0.9982029,0.0005657402,0.0003890624,0.0004264934,0.0002646321,0.0001512191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002944668,0.00008942838,0.0007334592,0.00003287898,0.00009850973,0.0000749122,0.00116527,0.02364417,0.00001423136,0.1136307,0.005762297,0.8547246],"study_design_scores_gemma":[0.0008650203,0.0003648088,0.0006813024,0.0001513511,0.0000134356,0.002140356,0.0001872752,0.8733663,0.0000590584,0.02315369,0.09872011,0.0002972807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005328475,0.0002005245,0.9869441,0.001545119,0.001953136,0.0003228505,0.000002121888,0.0001266739,0.00357703],"genre_scores_gemma":[0.8245104,0.00009156752,0.1709392,0.001779814,0.002268012,0.000009815321,0.000002108697,0.00002786841,0.0003712128],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8544273,"threshold_uncertainty_score":0.9999971,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03735851513923256,"score_gpt":0.2758705309087951,"score_spread":0.2385120157695625,"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."}}