{"id":"W2059816321","doi":"10.1287/ijoc.1040.0117","title":"The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3","year":2006,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":215,"is_retracted":false,"has_abstract":true,"ca_institutions":"Kronos (Canada)","funders":"","keywords":"Shortest path problem; Mathematical optimization; Vehicle routing problem; Benchmark (surveying); Mathematics; Column generation; Relaxation (psychology); Integer (computer science); Path (computing); Scheduling (production processes); Routing (electronic design automation); Computer science; Combinatorics; Graph","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":[],"consensus_categories":[],"category_scores_codex":[0.00110573,0.0001503237,0.000139537,0.00007030197,0.0005817477,0.000332141,0.0001255056,0.00005354085,0.000001318748],"category_scores_gemma":[0.00006630085,0.00009794606,0.00003750544,0.0001471697,0.00008044481,0.0001698499,0.00001977141,0.0002926895,0.000001153143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006365768,"about_ca_system_score_gemma":0.00002684414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001061134,"about_ca_topic_score_gemma":0.000001688568,"domain_scores_codex":[0.9989424,0.00002464971,0.0004073178,0.000097223,0.0002152846,0.0003130837],"domain_scores_gemma":[0.9990131,0.0005309946,0.0001595597,0.0001003697,0.0001280634,0.00006796198],"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.00002062001,0.000006881754,0.00049216,0.00001523368,0.00001792414,0.000002696107,0.000131903,0.838854,0.00008419505,0.001785261,0.0005355927,0.1580535],"study_design_scores_gemma":[0.0009254325,0.0001746129,0.001652938,0.0001832367,0.00001710736,0.0003860919,0.0001902316,0.9824523,0.0004124487,0.0007665737,0.01261756,0.0002214592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1120515,0.0001137994,0.874694,0.0003269811,0.0001587408,0.0003665902,0.00000360715,0.0002267537,0.01205796],"genre_scores_gemma":[0.8709671,0.0000132689,0.1285599,0.0001247247,0.0002504041,0.000004244282,0.000004096568,0.00003510058,0.00004121979],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7589155,"threshold_uncertainty_score":0.4474392,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006429132118342962,"score_gpt":0.2240080083722953,"score_spread":0.2175788762539524,"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."}}