{"id":"W2951794473","doi":"10.48550/arxiv.1708.01335","title":"Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Orienteering; Regret; Rounding; Mathematics; Linear programming relaxation; Approximation algorithm; Routing (electronic design automation); Bounded function; Path (computing); Mathematical optimization; Combinatorics; Node (physics); Point (geometry); Linear programming; Discrete mathematics; Computer science; Statistics; Computer network; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005207896,0.0003893526,0.0004696204,0.0001666155,0.0004045427,0.0002408327,0.0005451115,0.000351432,0.000009492917],"category_scores_gemma":[0.0002003034,0.0004985361,0.0001469683,0.0001438008,0.0001080431,0.0002634639,0.0004112269,0.0005628425,0.00000600466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002710426,"about_ca_system_score_gemma":0.00007261976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007553465,"about_ca_topic_score_gemma":0.00002465727,"domain_scores_codex":[0.9984338,0.00007087734,0.0002535419,0.0007000809,0.00007316982,0.0004685625],"domain_scores_gemma":[0.9984312,0.0001716669,0.0002280886,0.0008450805,0.0001485924,0.0001753394],"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.00003338119,0.00002102272,0.007528974,0.0005214587,0.0001732887,0.00002856906,0.0002558607,0.9729597,0.0002286679,0.01737595,0.00007844225,0.0007947069],"study_design_scores_gemma":[0.0008654987,0.00002757881,0.001293558,0.0002825233,0.0001311406,0.000004590772,0.0001048468,0.9911192,0.0007151989,0.004216656,0.000702788,0.0005363915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4696372,0.000113817,0.5236339,0.00003949873,0.0006830385,0.0006940002,0.0000472806,0.0007326565,0.004418654],"genre_scores_gemma":[0.9839306,0.000087885,0.01473101,0.00001032962,0.0001395775,0.000002315404,0.00003163527,0.00009608597,0.0009705864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5142934,"threshold_uncertainty_score":0.9997466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0782951958348076,"score_gpt":0.2209477236456444,"score_spread":0.1426525278108368,"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."}}