{"id":"W2132103269","doi":"10.1155/2013/203032","title":"A New Formulation of the Set Covering Problem for Metaheuristic Approaches","year":2013,"lang":"en","type":"article","venue":"ISRN Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Metaheuristic; Heuristic; Redundancy (engineering); Mathematical optimization; Computer science; Set (abstract data type); Computation; Greedy algorithm; Algorithm; Mathematics","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.001696584,0.001469012,0.0009273607,0.0009784438,0.0004356181,0.001687343,0.001841967,0.001825685,0.003556275],"category_scores_gemma":[0.003810872,0.0005749355,0.00194393,0.001965345,0.0009419175,0.001871441,0.001336072,0.002902451,0.0007015891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001247018,"about_ca_system_score_gemma":0.001112447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001005279,"about_ca_topic_score_gemma":0.001357447,"domain_scores_codex":[0.9982875,0.0008692452,0.00008601803,0.0001777374,0.0004913227,0.0000880505],"domain_scores_gemma":[0.9989944,0.0005917985,0.0001116533,0.0001271375,0.0001419693,0.00003296807],"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.00003746983,0.00009729488,0.0002987623,0.0006506162,0.000122655,0.0002570728,0.0001975421,0.5321197,0.004525474,0.339352,0.008380842,0.1139606],"study_design_scores_gemma":[0.00003688718,0.0001248313,0.0001942914,0.0001751134,0.00005986695,0.0004156561,0.00008584824,0.8345827,0.001712669,0.119736,0.04283946,0.0000366751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002183133,0.001250449,0.9893332,0.000506658,0.0001919943,0.0001120189,0.00007639098,0.00006959519,0.006276516],"genre_scores_gemma":[0.07255021,0.002490075,0.9184358,0.0004037114,0.0003902406,0.0005306024,0.0002134635,0.0001405598,0.00484536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003556275,"threshold_uncertainty_score":0.01189697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.179304863765306,"score_gpt":0.3703466710522083,"score_spread":0.1910418072869022,"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."}}