{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001803012,0.00158135,0.00204193,0.002740719,0.001309258,0.001334798,0.00215088,0.002464724,0.01562411],"category_scores_gemma":[0.006464671,0.001233727,0.001170976,0.003601862,0.00101782,0.001788561,0.0009587639,0.001656755,0.001970472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00157325,"about_ca_system_score_gemma":0.002588106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01116285,"about_ca_topic_score_gemma":0.009226293,"domain_scores_codex":[0.9990702,0.0004639715,0.00003684125,0.0001288756,0.0001900005,0.0001101834],"domain_scores_gemma":[0.9970551,0.002252415,0.0001026457,0.0001481096,0.0003676086,0.00007415944],"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.0002483254,0.0001796015,0.0004185452,0.0001593498,0.00007446075,0.00005096621,0.00006956263,0.7190906,0.0007744684,0.009831248,0.01452737,0.2545755],"study_design_scores_gemma":[0.00008077289,0.00005471923,0.00007631921,0.00001523805,0.00001764398,0.00001778558,0.00001432587,0.9911172,0.0001817167,0.007236839,0.001180516,0.000006837716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01810802,0.001313832,0.9683411,0.0004058416,0.0002073661,0.0002747928,0.0004698907,0.002758742,0.008120424],"genre_scores_gemma":[0.117828,0.0003849682,0.8751347,0.0002510562,0.0001063785,0.0005779448,0.0006921369,0.0003943956,0.004630449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01562411,"threshold_uncertainty_score":0.05226785,"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."}}