{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001707709,0.0001025391,0.0002696059,0.00008844805,0.0001263166,0.00006157724,0.001326433,0.00004952071,0.000005588809],"category_scores_gemma":[0.0008481406,0.00006812978,0.0001027187,0.0006510509,0.0001218878,0.0001716652,0.00008908426,0.0004400712,0.000001847038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002434637,"about_ca_system_score_gemma":0.0001859142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003895628,"about_ca_topic_score_gemma":5.782919e-7,"domain_scores_codex":[0.9983307,0.0002816982,0.0004541711,0.0001282728,0.0004936394,0.0003115919],"domain_scores_gemma":[0.9956447,0.002844678,0.0002941333,0.000266472,0.0007856319,0.000164426],"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.001179983,0.0001386261,0.0006785147,0.0001061057,0.0003052258,0.0001631969,0.00157757,0.9222888,0.005574738,0.04475287,0.01597632,0.007257978],"study_design_scores_gemma":[0.0007116494,0.000938028,0.0002245101,0.00003302174,0.00002317976,0.0000493393,0.0001299966,0.9860276,0.00247642,0.007780023,0.001504451,0.0001017656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001176858,0.0007109508,0.9960947,0.001573676,0.0001619806,0.0002359343,0.00000909173,0.00001259008,0.00002419105],"genre_scores_gemma":[0.8281026,0.000292439,0.1709989,0.0002656257,0.0002666984,0.000003839014,0.000001027026,0.00002296716,0.00004591733],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8269258,"threshold_uncertainty_score":0.2778251,"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."}}