{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00193629,0.0003121358,0.0002681738,0.0002021771,0.000409887,0.0001599579,0.0003607115,0.0002689537,0.00002773988],"category_scores_gemma":[0.0003515407,0.00028195,0.0001582855,0.0004898823,0.00004283345,0.000270006,0.00006366041,0.0003654982,0.000006025083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004104614,"about_ca_system_score_gemma":0.00007646364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002125761,"about_ca_topic_score_gemma":0.0002133083,"domain_scores_codex":[0.9981149,0.0001363323,0.0004373556,0.0002934875,0.000222688,0.0007952219],"domain_scores_gemma":[0.9986972,0.0003095361,0.000105377,0.0006411048,0.0001135578,0.0001331889],"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.00006302648,0.000173859,0.00828921,0.0003767258,0.0002531701,0.00001040514,0.0009058198,0.7429562,0.04224875,0.1325909,0.02180215,0.05032977],"study_design_scores_gemma":[0.0003618253,0.00005151487,0.0005230606,0.00004496911,0.00004320943,0.0000462216,0.00007760776,0.8723715,0.06512423,0.00194768,0.05900808,0.0004000988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001810577,0.001002166,0.9907923,0.0005861167,0.0001586003,0.001482439,0.00006179641,0.002673557,0.001432448],"genre_scores_gemma":[0.3481485,0.0002380759,0.6496234,0.0004832607,0.00009937329,0.0009354449,0.00001984705,0.0001315425,0.0003206341],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3463379,"threshold_uncertainty_score":0.9999633,"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."}}