{"id":"W4255492803","doi":"10.1002/net.20061","title":"Exact solution of the centralized network design problem on directed graphs","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of Alberta","funders":"","keywords":"Column generation; Cutting-plane method; Lagrangian relaxation; Spanning tree; Steiner tree problem; Mathematical optimization; Branch and bound; Directed graph; Linear programming relaxation; Interior point method; Branch and cut; Mathematics; Relaxation (psychology); Constraint (computer-aided design); Upper and lower bounds; Tree (set theory); Point (geometry); Computer science; Linear programming; Integer programming; Combinatorics","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.0004990961,0.0001421458,0.0001687995,0.00003080334,0.00009230384,0.0000169457,0.000172608,0.0001335875,0.00004564171],"category_scores_gemma":[0.00002930545,0.0001137666,0.00008211788,0.0005524272,0.00003093639,0.00005566368,0.00002152077,0.0002403732,0.000003872243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006388223,"about_ca_system_score_gemma":0.0000105191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003576333,"about_ca_topic_score_gemma":0.000005052309,"domain_scores_codex":[0.9988103,0.0002775499,0.000274228,0.0001326246,0.000152858,0.0003524554],"domain_scores_gemma":[0.9993789,0.0001842706,0.00007744115,0.0002729369,0.00003855177,0.00004789564],"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.00001735432,0.00001367391,0.0005026048,0.000006955669,0.00002585757,1.368027e-7,0.00005142352,0.9736042,0.0001294604,0.0003417023,0.008123526,0.01718309],"study_design_scores_gemma":[0.0003051708,0.00001621798,0.002489242,0.0000847647,0.00002020799,0.00000112649,0.000001344102,0.9945984,0.0006622553,0.000176293,0.001526688,0.0001182437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003735433,0.000502415,0.9913509,0.0001129633,0.0005416421,0.0004404619,0.000001092685,0.0006458067,0.00266927],"genre_scores_gemma":[0.744341,0.0001542704,0.2549536,0.00008241316,0.0003122051,0.00001848677,0.000004575482,0.00004664408,0.00008677759],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7406055,"threshold_uncertainty_score":0.4639266,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01629736232607209,"score_gpt":0.2342150223181647,"score_spread":0.2179176599920926,"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."}}