{"id":"W2464795612","doi":"10.1007/s10878-018-0281-y","title":"Optimum turn-restricted paths, nested compatibility, and optimum convex polygons","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Theory of computation; Compatibility (geochemistry); Cutting-plane method; Regular polygon; Mathematical optimization; Combinatorics; Integer programming; Algorithm; Geometry","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.0006847584,0.0007475901,0.0007704716,0.0008189271,0.0005363482,0.001322756,0.0008500885,0.0008956621,0.006094272],"category_scores_gemma":[0.005702829,0.0008095592,0.0006804878,0.0007567662,0.001227292,0.002288808,0.001559949,0.001181742,0.0004493463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005227211,"about_ca_system_score_gemma":0.0007548523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00104745,"about_ca_topic_score_gemma":0.001411915,"domain_scores_codex":[0.9994318,0.0002075378,0.00001601289,0.00009866741,0.0001583223,0.00008766526],"domain_scores_gemma":[0.9987477,0.0007321474,0.0001995364,0.0001094311,0.0001188217,0.00009237645],"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.0002797211,0.0001114472,0.001292607,0.0001189558,0.00003289362,0.000198747,0.0001772615,0.5967433,0.004206613,0.3612743,0.002591848,0.03297231],"study_design_scores_gemma":[0.00004591681,0.0001041323,0.0006184438,0.00003826182,0.00002175814,0.0002097042,0.0001067288,0.6928335,0.002118335,0.3001619,0.003720097,0.00002132615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1351054,0.0002289866,0.8330826,0.0002696894,0.00004148549,0.00008524172,0.0002312307,0.0001065692,0.03084883],"genre_scores_gemma":[0.7720169,0.0004228051,0.2150258,0.00009227256,0.00003967182,0.0001784513,0.0003492511,0.0002079351,0.01166687],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006094272,"threshold_uncertainty_score":0.02038741,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01346206289503094,"score_gpt":0.2613608915506082,"score_spread":0.2478988286555773,"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."}}