{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002988445,0.00003833937,0.0000801331,0.0002010508,0.0002823977,0.00004904943,0.0001790439,0.00004486274,0.0001036904],"category_scores_gemma":[0.0002676725,0.0000325232,0.00002529277,0.001039975,0.0001490457,0.0002698122,0.000003197333,0.00009653725,0.000005373388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002169197,"about_ca_system_score_gemma":0.0002177815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001673354,"about_ca_topic_score_gemma":0.004664484,"domain_scores_codex":[0.9983442,0.0005001883,0.000269539,0.00009798696,0.0006182819,0.0001697617],"domain_scores_gemma":[0.9989729,0.0001890499,0.00002465149,0.0001201406,0.0006648771,0.00002838062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007259577,0.0007509284,0.001066835,0.00003289842,0.00001788127,0.000001662436,0.1526456,0.772374,0.003789108,0.04094763,0.001783838,0.02651705],"study_design_scores_gemma":[0.00727166,0.002878924,0.1782396,0.00157179,0.00007967168,0.000005007806,0.2604828,0.1042296,0.1759715,0.003194711,0.2646494,0.001425357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9130157,0.001015043,0.01444823,0.04584089,0.00004670785,0.0009787537,0.00002410769,0.00002089264,0.02460968],"genre_scores_gemma":[0.9982101,0.0005050338,0.0007712635,0.0001334187,0.00004005018,0.00002548605,0.00002740839,0.000003480184,0.0002837185],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6681444,"threshold_uncertainty_score":0.2602892,"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."}}