{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075207,0.0002824437,0.0005387263,0.0003619984,0.0001680778,0.0001721154,0.0002736807,0.0002515327,0.00009877647],"category_scores_gemma":[0.0005987437,0.0002818794,0.00009758153,0.0007591706,0.0001609262,0.0005981466,0.00006791126,0.0003966065,0.000004974376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001539275,"about_ca_system_score_gemma":0.0001106187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005975561,"about_ca_topic_score_gemma":3.208665e-7,"domain_scores_codex":[0.9977541,0.0002787958,0.0009991,0.0001997481,0.0004506342,0.0003176543],"domain_scores_gemma":[0.9976638,0.0002673074,0.0004651103,0.0002783368,0.001063132,0.0002622912],"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.0001170328,0.0001061231,0.001668514,0.00003782767,0.00009488672,0.000009527177,0.0004323298,0.9935775,0.001100637,0.0008261983,0.001030845,0.000998517],"study_design_scores_gemma":[0.002873867,0.0005217673,0.002037068,0.00008701444,0.0001034462,0.00009008652,0.00007354196,0.9909204,0.001824578,0.0006676734,0.0004727981,0.0003277135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1767209,0.0003561156,0.8120822,0.0002424918,0.008568142,0.0003922334,0.00001214197,0.000302967,0.001322809],"genre_scores_gemma":[0.7324615,0.0001611711,0.266355,0.00004026086,0.0008834687,0.000002497472,0.00001239244,0.00006617303,0.0000176276],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5557405,"threshold_uncertainty_score":0.9999633,"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."}}