{"id":"W2295299369","doi":"","title":"Solution Techniques for the Large Set Covering Problem","year":2003,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Set cover problem; Mathematics; Cover (algebra); Constraint satisfaction problem; Heuristic; Set (abstract data type); Extension (predicate logic); Combinatorics; Constraint (computer-aided design); Family of sets; Computation; Discrete mathematics; Algorithm; Mathematical optimization; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00185209,0.001266006,0.001051987,0.001618499,0.0009454875,0.001498276,0.001602135,0.001410692,0.005952722],"category_scores_gemma":[0.006610916,0.000783801,0.001693654,0.002855968,0.0009842404,0.001964183,0.002010795,0.002145549,0.0008368435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001366372,"about_ca_system_score_gemma":0.001435473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002066244,"about_ca_topic_score_gemma":0.002548428,"domain_scores_codex":[0.9982964,0.0005807781,0.00007960113,0.000292512,0.0005858998,0.000164782],"domain_scores_gemma":[0.9977912,0.001567339,0.0001794089,0.0002292105,0.000183491,0.00004943071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001178929,0.0001555244,0.0007689235,0.0006928833,0.0001104426,0.0002048522,0.0004538262,0.4509455,0.00431237,0.2260457,0.01010591,0.3060861],"study_design_scores_gemma":[0.0001064793,0.0000978356,0.0002591697,0.0001236914,0.00005400666,0.0003296914,0.0001494198,0.7532113,0.002553521,0.2175752,0.02550963,0.00002991193],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003737887,0.0004267486,0.9916334,0.000221678,0.00002728378,0.0001001366,0.00006490501,0.0001741724,0.00361368],"genre_scores_gemma":[0.06950422,0.0008717776,0.9259159,0.0001217767,0.00009969252,0.0004438148,0.0003560803,0.0001440662,0.002542732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005952722,"threshold_uncertainty_score":0.01991379,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01391323732630745,"score_gpt":0.2498786440217084,"score_spread":0.2359654066954009,"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."}}