{"id":"W2916219982","doi":"10.1007/s10732-020-09453-x","title":"A tabu search for the design of capacitated rooted survivable planar networks","year":2020,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Tabu search; Combinatorics; Mathematics; Planar graph; Mathematical optimization; Shortest path problem; Graph; Path (computing); Integer programming; 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.001467543,0.001517665,0.001488385,0.002710924,0.0008971428,0.00154038,0.002092417,0.002174949,0.01302154],"category_scores_gemma":[0.007441523,0.001273776,0.0009495092,0.002233594,0.001171011,0.001655342,0.001216047,0.001288593,0.001132055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001723784,"about_ca_system_score_gemma":0.002381763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008114025,"about_ca_topic_score_gemma":0.009057824,"domain_scores_codex":[0.9992291,0.0004117225,0.00002424436,0.0001014004,0.00008978522,0.0001436816],"domain_scores_gemma":[0.9961486,0.003110297,0.0001943661,0.0001223273,0.0002972804,0.0001271605],"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.0001922237,0.000124741,0.0005881701,0.0001675366,0.00003536581,0.00005128993,0.00008142181,0.9279671,0.00052587,0.007966761,0.00360897,0.05869057],"study_design_scores_gemma":[0.00005125557,0.00007597358,0.0000722521,0.00002552146,0.00001165428,0.00001110909,0.00005589634,0.9920341,0.0001951199,0.006870597,0.0005901371,0.000006284999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1422381,0.001572442,0.8225098,0.001067561,0.000159803,0.0006399548,0.001195142,0.002442904,0.02817424],"genre_scores_gemma":[0.4925336,0.0005295915,0.4979878,0.0003885746,0.00005682243,0.0006068358,0.001083998,0.0003748303,0.006437978],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01302154,"threshold_uncertainty_score":0.04356134,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08577908369528642,"score_gpt":0.30450855670641,"score_spread":0.2187294730111236,"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."}}