{"id":"W2085697310","doi":"10.1016/j.cor.2015.04.007","title":"Path based algorithms for metro network design","year":2015,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Path (computing); A priori and a posteriori; Network planning and design; Set (abstract data type); Integer (computer science); Mathematical optimization; Algorithm; Integer programming; Linear programming; Population; Mathematics","routes":{"ca_aff":true,"ca_fund":true,"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.001115354,0.001469915,0.001385023,0.001615711,0.0008063656,0.0009506983,0.001451503,0.001419136,0.00749005],"category_scores_gemma":[0.004051189,0.0009640299,0.0008444513,0.002126342,0.0007420354,0.001489366,0.001098433,0.001566775,0.000845859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001183186,"about_ca_system_score_gemma":0.001773546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00939614,"about_ca_topic_score_gemma":0.009557503,"domain_scores_codex":[0.9995517,0.00020771,0.00001528305,0.00006727703,0.0001102289,0.00004782765],"domain_scores_gemma":[0.9983383,0.001248034,0.00009030491,0.0000761753,0.0001933921,0.00005367069],"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.00002376888,0.00002799825,0.0001211626,0.00005022839,0.00002012243,0.00000925423,0.00001941933,0.9507437,0.0001748885,0.01029311,0.001543785,0.03697259],"study_design_scores_gemma":[0.00001083895,0.00001504484,0.00002849101,0.000008928899,0.000005333205,0.000005065438,0.000006346724,0.9865016,0.00008785899,0.01233344,0.0009938893,0.000003188109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003088143,0.0003924677,0.993399,0.0001160303,0.00004469101,0.00005889977,0.00007876423,0.0002229838,0.002599035],"genre_scores_gemma":[0.1800588,0.001105024,0.8093673,0.0001177901,0.00009335947,0.0005125258,0.0003404685,0.0002180601,0.008186649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00939614,"threshold_uncertainty_score":0.02505666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2998911981469053,"score_gpt":0.4523902647933835,"score_spread":0.1524990666464782,"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."}}