{"id":"W2130863730","doi":"10.1016/j.dam.2006.04.043","title":"Solution techniques for the Large Set Covering Problem","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Mathematics; Set (abstract data type); Set cover problem; Combinatorics; Mathematical optimization; Computer science; Programming language","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.0005039693,0.0001484854,0.0001556228,0.0000356675,0.0001515202,0.00006051133,0.0001571962,0.00007799995,0.00001082205],"category_scores_gemma":[0.00001780068,0.000116159,0.00005514027,0.0001319333,0.00002220892,0.00005146403,0.00003899295,0.00009732583,0.000008222204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004655747,"about_ca_system_score_gemma":0.00000678676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002341449,"about_ca_topic_score_gemma":0.000003067581,"domain_scores_codex":[0.9991953,0.000005864292,0.0002812362,0.0001151226,0.0001293517,0.0002731109],"domain_scores_gemma":[0.9994247,0.0002019406,0.00006468876,0.0002599022,0.00002830566,0.00002047155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000112071,0.00007256729,0.00002567688,0.001531713,0.0001048278,6.205774e-7,0.001579563,0.3672867,0.05423439,0.5569847,0.01091023,0.007257772],"study_design_scores_gemma":[0.0002325487,0.00000793486,0.00001194168,0.0000356958,0.00004842538,0.000002593235,0.0001830379,0.9352152,0.03141187,0.02358001,0.009045744,0.0002249451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006533945,0.00004980451,0.9826466,0.00005289487,0.00004129946,0.0008200465,0.00003569882,0.0007658817,0.01493435],"genre_scores_gemma":[0.1686092,0.0000134503,0.8307727,0.00002436823,0.0001165663,0.0002452358,0.00004225468,0.00007269596,0.0001035988],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5679285,"threshold_uncertainty_score":0.4736825,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01478892021750576,"score_gpt":0.2620394275392539,"score_spread":0.2472505073217481,"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."}}