{"id":"W2021665984","doi":"10.1007/s10479-005-2038-0","title":"Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment","year":2005,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":80,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Heuristics; Theory of computation; Heuristic; Maximization; Computer science; Greedy algorithm; Mathematical optimization; Extension (predicate logic); Upper and lower bounds; Simple (philosophy); Computational complexity theory; Transit (satellite); Algorithm; Mathematics; Public transport; Transport engineering; Engineering","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.0008430483,0.0006941619,0.001399021,0.0008744219,0.0005596344,0.001019302,0.00102929,0.0009923852,0.002450409],"category_scores_gemma":[0.004991587,0.0006152493,0.0005043258,0.001355994,0.0006056692,0.00131111,0.001174301,0.0004784781,0.0005204153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006746591,"about_ca_system_score_gemma":0.0008358215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003793811,"about_ca_topic_score_gemma":0.002450632,"domain_scores_codex":[0.9994807,0.0002305348,0.00001222337,0.00009751829,0.00005382601,0.0001251782],"domain_scores_gemma":[0.9981934,0.001057288,0.0002982793,0.00009236216,0.0001768453,0.0001817423],"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.0006040046,0.00005689761,0.00262086,0.0001178369,0.00006884742,0.0003120556,0.0001221042,0.9593506,0.004506338,0.01158968,0.001615215,0.01903551],"study_design_scores_gemma":[0.00004144269,0.0002094422,0.001165465,0.00001014587,0.00004517741,0.0001503686,0.00009471438,0.9889474,0.001325246,0.007405227,0.0005907563,0.00001460445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6124514,0.000345398,0.3743314,0.0006272566,0.00003703993,0.0001095425,0.0005216031,0.0003109229,0.01126549],"genre_scores_gemma":[0.9698741,0.0001508735,0.02778708,0.00002330869,0.00003640046,0.0000396284,0.0001197447,0.00004190411,0.001926836],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003793811,"threshold_uncertainty_score":0.008197427,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2356324665256801,"score_gpt":0.4466647061607565,"score_spread":0.2110322396350764,"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."}}