{"id":"W205201433","doi":"10.1023/a:1014517910427","title":"A Tabu Search Algorithm for Access Network Design","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Institut National de la Recherche Scientifique","funders":"","keywords":"Synchronous optical networking; Computer science; Tabu search; Hierarchy; Set (abstract data type); Transmission (telecommunications); Computer network; Distributed computing; Theory of computation; Population; Tree (set theory); Variety (cybernetics); Telecommunications; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165127,0.0001044997,0.0001732653,0.0002125887,0.0002616458,0.0001162736,0.0005554529,0.00011361,0.00006725286],"category_scores_gemma":[0.0002692234,0.0001001405,0.00004872064,0.001204282,0.0001922841,0.0003677748,0.0001527238,0.0003479912,0.00002417203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000237418,"about_ca_system_score_gemma":0.00005408901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001253213,"about_ca_topic_score_gemma":0.00001937391,"domain_scores_codex":[0.9984391,0.00007787871,0.0002401222,0.0001898544,0.0003396709,0.0007134159],"domain_scores_gemma":[0.9983387,0.0005674268,0.000005181977,0.000358463,0.0006465438,0.00008367822],"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.00001023006,0.00002451679,0.00001500682,0.00001214711,0.00002557838,0.000003391949,0.00001858323,0.8273998,0.0002082129,0.003132424,0.01887572,0.1502743],"study_design_scores_gemma":[0.0001407812,0.0001532969,0.00006234974,0.0000304204,0.000001869605,0.000002930013,0.00006868463,0.9760034,0.005929655,0.00400081,0.01348908,0.0001166952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003886624,0.001089954,0.9913227,0.001198231,0.0000489301,0.0008396995,0.00001476467,0.0002359353,0.001363159],"genre_scores_gemma":[0.1356531,0.005193587,0.8568071,0.00008433171,0.0004276894,0.000793998,0.00003862435,0.00008042574,0.0009211614],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1501576,"threshold_uncertainty_score":0.408361,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.338369525969853,"score_gpt":0.4751339150380393,"score_spread":0.1367643890681862,"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."}}