{"id":"W2795184361","doi":"10.1371/journal.pone.0192454","title":"An outer approximation method for the road network design problem","year":2018,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Mathematical optimization; Network planning and design; Heuristic; Bilevel optimization; Relaxation (psychology); Computer science; Integer programming; Linear programming; Constraint (computer-aided design); Integer (computer science); Function (biology); Set (abstract data type); Optimization problem; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001982535,0.001317119,0.001295021,0.000987903,0.0004986614,0.00169002,0.001208464,0.001229971,0.005271453],"category_scores_gemma":[0.004399288,0.0005815116,0.001260523,0.001164212,0.0009689997,0.001442492,0.001379909,0.002397324,0.001119005],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001301236,"about_ca_system_score_gemma":0.001723872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005794181,"about_ca_topic_score_gemma":0.004648742,"domain_scores_codex":[0.9989385,0.0004780786,0.00003636497,0.0001258957,0.000317166,0.0001040427],"domain_scores_gemma":[0.9984149,0.001084209,0.0001105397,0.0001146388,0.0002238023,0.00005196866],"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.00004785374,0.00004165757,0.0002089157,0.0001192214,0.0000284026,0.00004734623,0.00006817298,0.9136938,0.0007851351,0.04142393,0.001942584,0.04159293],"study_design_scores_gemma":[0.000006046921,0.00001674662,0.00002363155,0.00001143917,0.000004688545,0.00001244862,0.00001063434,0.9905799,0.0001409381,0.007360339,0.00183043,0.000002844403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002441714,0.0002602795,0.9920506,0.0001293932,0.00004149522,0.00003883044,0.00004212874,0.0001191525,0.004876435],"genre_scores_gemma":[0.1853929,0.000995894,0.8012417,0.0002085439,0.0001138703,0.0004892432,0.0004374593,0.0002687479,0.01085162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005794181,"threshold_uncertainty_score":0.01763481,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09598481210997836,"score_gpt":0.3233842029370459,"score_spread":0.2273993908270675,"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."}}