{"id":"W2094204336","doi":"10.1007/s10732-013-9235-9","title":"An iterated-tabu-search heuristic for a variant of the partial set covering problem","year":2013,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Mathematical optimization; Iterated local search; Local optimum; Mathematics; Guided Local Search; Iterated function; Set cover problem; Local search (optimization); Heuristic; Set (abstract data type); Algorithm; 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.0009934797,0.0006597869,0.001344664,0.00076597,0.0006625231,0.0009764647,0.002260446,0.001634429,0.003870825],"category_scores_gemma":[0.003693843,0.0005245221,0.001165171,0.001033011,0.0006638106,0.001058862,0.001010345,0.001028054,0.000302657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001141032,"about_ca_system_score_gemma":0.001453436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005816432,"about_ca_topic_score_gemma":0.005873956,"domain_scores_codex":[0.9994835,0.0002134459,0.00001734855,0.00007489268,0.0001128401,0.00009795609],"domain_scores_gemma":[0.9988955,0.0007220003,0.00006940187,0.0001089162,0.0001414461,0.0000626304],"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.0001062484,0.0001107746,0.0004421502,0.00009052748,0.00005897453,0.0001436964,0.0000796879,0.9249974,0.001407422,0.01480683,0.002338175,0.0554181],"study_design_scores_gemma":[0.00002132682,0.00003940426,0.00009372262,0.000008377699,0.00001652796,0.00003277463,0.00001233345,0.9963136,0.0002670349,0.002591759,0.0005971687,0.000006016308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1442863,0.0007016271,0.8313515,0.0005483401,0.0002189461,0.0003251146,0.0002139695,0.0007198508,0.02163431],"genre_scores_gemma":[0.5510395,0.0002307674,0.4435499,0.0001451278,0.00007637565,0.0002444373,0.000268373,0.0001857094,0.004259717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005816432,"threshold_uncertainty_score":0.01294917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03142935179164581,"score_gpt":0.3079221958660006,"score_spread":0.2764928440743548,"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."}}