{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00166958,0.001644151,0.001449735,0.0017165,0.0009916943,0.001180365,0.001882039,0.001420892,0.005996355],"category_scores_gemma":[0.005549254,0.0009783533,0.001298587,0.002302965,0.0008001095,0.002493165,0.001319377,0.002037542,0.001062618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001589719,"about_ca_system_score_gemma":0.002904704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006011101,"about_ca_topic_score_gemma":0.01111024,"domain_scores_codex":[0.9987274,0.0004947867,0.00005786383,0.0001708806,0.0002637775,0.0002852431],"domain_scores_gemma":[0.996042,0.002869514,0.0002134494,0.0004397069,0.0003170109,0.0001182978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005683911,0.0002495739,0.0008078709,0.000486496,0.000123029,0.0002395249,0.0002604694,0.6884844,0.00657354,0.04931434,0.02302571,0.2298667],"study_design_scores_gemma":[0.0002498942,0.0001414293,0.0003938078,0.00004982915,0.00005736498,0.0001105326,0.0001134176,0.940041,0.003722984,0.04644036,0.008643202,0.00003623537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0289823,0.0008809008,0.9603658,0.0002994922,0.00008082663,0.0003043969,0.0003544389,0.002390489,0.006341273],"genre_scores_gemma":[0.1251967,0.0004951917,0.8705639,0.0001644121,0.00006630255,0.0004212462,0.0009786718,0.0003358826,0.001777782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006011101,"threshold_uncertainty_score":0.02005976,"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."}}