{"id":"W3122240186","doi":"","title":"Optimum Turn-Restricted Paths, Nested Compatibility, and Optimum Convex Polygons","year":2016,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compatibility (geochemistry); Mathematics; Mathematical optimization; Regular polygon; Cutting-plane method; Integer programming; Combinatorics; Convex polygon; Path (computing); Computer science; Geometry; 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.0006521965,0.0009968061,0.000816309,0.0005602482,0.0003747572,0.001380085,0.001068381,0.0009948389,0.00729432],"category_scores_gemma":[0.003714052,0.0006528514,0.0007834738,0.0008440643,0.001185434,0.003415432,0.001480624,0.001781664,0.0005264239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008089091,"about_ca_system_score_gemma":0.0006534097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001091239,"about_ca_topic_score_gemma":0.001419596,"domain_scores_codex":[0.9994354,0.0001676467,0.00002180001,0.0001348138,0.0001550832,0.00008527386],"domain_scores_gemma":[0.9989453,0.0006714869,0.0001434012,0.0001060834,0.0000661976,0.00006757486],"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.000116578,0.0001034836,0.000526462,0.0002044546,0.00002951083,0.0001768911,0.0001526433,0.5623828,0.003594587,0.3927234,0.001951703,0.03803748],"study_design_scores_gemma":[0.00004552644,0.0001240622,0.0003521873,0.00005383436,0.00001867616,0.0001572307,0.0001151843,0.6788864,0.002941499,0.3097901,0.007492918,0.00002239703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04296536,0.0003210415,0.9412236,0.0003170047,0.00002813555,0.00007783461,0.0001832654,0.00008167515,0.01480221],"genre_scores_gemma":[0.4958945,0.001069394,0.4918656,0.0001375165,0.00008332387,0.0003226562,0.0005139393,0.0002074543,0.009905661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00729432,"threshold_uncertainty_score":0.02440196,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03557851359454558,"score_gpt":0.3186559526578178,"score_spread":0.2830774390632723,"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."}}