{"id":"W2064035628","doi":"10.1287/opre.51.4.655.16098","title":"Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":193,"is_retracted":false,"has_abstract":true,"ca_institutions":"Computer Research Institute of Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Neighbourhood (mathematics); Tabu search; Mathematical optimization; Fixed charge; Network planning and design; Metaheuristic; Flow network; Computer science; Simple (philosophy); Flow (mathematics); Multi-commodity flow problem; 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.003752542,0.000152476,0.0001756179,0.0001851929,0.0007774603,0.0002209233,0.00020613,0.000136637,0.0004052677],"category_scores_gemma":[0.001737925,0.0001610179,0.00005745428,0.0008424799,0.00007368735,0.0001669572,0.00001529267,0.0004027746,0.0000939937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001672543,"about_ca_system_score_gemma":0.0001700221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002325382,"about_ca_topic_score_gemma":0.00002854365,"domain_scores_codex":[0.9974614,0.001017614,0.0002924229,0.0002496893,0.0003156968,0.0006631611],"domain_scores_gemma":[0.997775,0.001134151,0.000009602235,0.0004139552,0.0005092947,0.0001579946],"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.000009134175,0.00004227414,0.00007439404,0.00002263532,0.00001918707,9.17448e-7,0.0001013594,0.9870769,0.002753171,0.004053839,0.005155132,0.000691018],"study_design_scores_gemma":[0.0006465916,0.00005123482,0.00005007425,0.00001503277,0.00000612595,0.000001310624,0.00002202709,0.9808561,0.01416039,0.0002024543,0.00381463,0.0001740149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005515533,0.00009806172,0.9904651,0.0002410304,0.0002190249,0.001035858,0.00002878676,0.0002623477,0.002134256],"genre_scores_gemma":[0.3813086,0.00001259649,0.6176606,0.00004566898,0.0000958299,0.0004038206,0.00004331163,0.00006079383,0.0003687405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3757931,"threshold_uncertainty_score":0.6566118,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1244174663249808,"score_gpt":0.375052910876536,"score_spread":0.2506354445515552,"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."}}