{"id":"W2089233175","doi":"10.1023/b:anor.0000039515.90453.1d","title":"Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":125,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Theory of computation; Path (computing); Mathematical optimization; Mathematics; Heuristic; Set (abstract data type); Local search (optimization); Network planning and design; Computer science; Algorithm","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.001006236,0.00008611563,0.0001343866,0.000116506,0.0002255634,0.0001014166,0.0001059553,0.00007022643,0.00005051139],"category_scores_gemma":[0.0003206279,0.00008091242,0.00002840029,0.0003929953,0.000123126,0.0001362521,0.00002528599,0.0002358394,0.00001535855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001700445,"about_ca_system_score_gemma":0.00005891309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005382003,"about_ca_topic_score_gemma":0.0000229198,"domain_scores_codex":[0.9989751,0.0001123521,0.0002342553,0.0001189752,0.0002499077,0.0003093966],"domain_scores_gemma":[0.9991707,0.0001791304,0.000008415477,0.0001894693,0.0003361105,0.0001162074],"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.000005586074,0.00006284684,0.00001206939,0.00005701763,0.00001407784,0.000001793006,0.0002378019,0.9895903,0.0003451922,0.007660192,0.0003947604,0.001618389],"study_design_scores_gemma":[0.0003684629,0.00009665495,0.00008475396,0.00009887445,0.000003292857,0.000001099665,0.00005348588,0.9905731,0.00429009,0.004154856,0.0001746939,0.0001006561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06260461,0.0004022242,0.933629,0.001277094,0.00004825114,0.0005529463,0.000007363436,0.0001624883,0.00131608],"genre_scores_gemma":[0.8560601,0.0001355878,0.1436357,0.00005484817,0.00003073171,0.00003606125,0.00001131699,0.0000189874,0.0000166765],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7934555,"threshold_uncertainty_score":0.3299513,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1840381061706795,"score_gpt":0.3873745427847574,"score_spread":0.2033364366140779,"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."}}