{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007331605,0.00134299,0.0008703516,0.0005847059,0.0008312759,0.001321645,0.001151861,0.0009509392,0.007293896],"category_scores_gemma":[0.002524458,0.0004692383,0.001308292,0.001700882,0.0006182919,0.001667771,0.0006933857,0.002212452,0.000436314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001569045,"about_ca_system_score_gemma":0.002510711,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01672332,"about_ca_topic_score_gemma":0.01645963,"domain_scores_codex":[0.9991897,0.0002137842,0.00003077581,0.0001709752,0.0001333187,0.000261528],"domain_scores_gemma":[0.9985279,0.0009359372,0.0001876352,0.00009451184,0.0001487049,0.0001053341],"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.0002852612,0.0003325997,0.001002456,0.0005283007,0.00005675658,0.0003366605,0.0001154446,0.9179599,0.003334978,0.02961303,0.01006178,0.03637279],"study_design_scores_gemma":[0.0001076476,0.0001465414,0.001068006,0.00003618788,0.00003526353,0.0002084593,0.0001949915,0.9564266,0.002463838,0.03283006,0.006454571,0.0000279185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5686519,0.002746888,0.3579856,0.002369709,0.0002534551,0.0005958563,0.006383428,0.0007535096,0.06025967],"genre_scores_gemma":[0.768841,0.00128007,0.2090243,0.0003055437,0.00008486674,0.0004193386,0.007396282,0.0003579271,0.01229069],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01672332,"threshold_uncertainty_score":0.033252,"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."}}