{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297514,0.0006955482,0.0010524,0.0005482623,0.0004605286,0.0008695534,0.000954127,0.0007963436,0.00414707],"category_scores_gemma":[0.002829977,0.0004771604,0.0004866192,0.0007033619,0.0007259709,0.0008755198,0.0008928435,0.0009914208,0.0004180026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001339397,"about_ca_system_score_gemma":0.001753939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003479596,"about_ca_topic_score_gemma":0.003965465,"domain_scores_codex":[0.9994442,0.000189232,0.00001563188,0.0001009544,0.0001667691,0.00008321348],"domain_scores_gemma":[0.9988142,0.000702593,0.0001223585,0.0001188172,0.0001828446,0.00005911685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001945948,0.00001737732,0.00009361929,0.00003416611,0.000007086661,0.00002151597,0.00001919935,0.9692348,0.0007685004,0.01062059,0.0006716747,0.01849206],"study_design_scores_gemma":[0.000009765103,0.00001146339,0.0000240095,0.000003421557,0.000002338405,0.000007579663,0.000007529512,0.9923335,0.0003694382,0.00686365,0.0003653473,0.000001988974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01176981,0.00009167151,0.9854035,0.00008787541,0.00001370861,0.0000278799,0.00004089276,0.0001440469,0.002420611],"genre_scores_gemma":[0.4930052,0.0002500353,0.5016335,0.00007314164,0.00003977719,0.0002221848,0.0001970715,0.0001294567,0.004449463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00414707,"threshold_uncertainty_score":0.0138734,"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."}}