{"id":"W311217234","doi":"10.1007/0-387-25486-2_2","title":"Shortest Path Problems with Resource Constraints","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":573,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Shortest path problem; Computer science; Column generation; Resource (disambiguation); Mathematical optimization; Scheduling (production processes); Path (computing); Vehicle routing problem; Operations research; Resource constraints; Routing (electronic design automation); Distributed computing; Engineering; Mathematics; Theoretical computer science; Graph; Computer network","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.0001766285,0.0003731139,0.0003336806,0.0001126492,0.00004032636,0.00004956128,0.0001452971,0.0003154097,0.0008900351],"category_scores_gemma":[0.000006593001,0.0003310273,0.00005897738,0.00003736449,0.0001285688,0.00003933614,0.00002456552,0.0004020171,0.00007492803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007402596,"about_ca_system_score_gemma":0.00003066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004288561,"about_ca_topic_score_gemma":0.000009293411,"domain_scores_codex":[0.9988833,0.0000107799,0.0003234743,0.0002860969,0.0002461081,0.0002502543],"domain_scores_gemma":[0.999368,0.0000689847,0.00006545691,0.0003537481,0.00006002879,0.00008377055],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002506015,0.00000677991,0.00006960961,0.00009808774,0.0001067614,0.00003892697,0.00004215699,0.9496067,0.0000250587,0.01829628,0.02037865,0.01132854],"study_design_scores_gemma":[0.0007398713,0.0001185587,0.00006494656,0.001049251,0.0001764499,0.0001705816,0.00001666849,0.1680217,0.0001184383,0.001100426,0.8264869,0.00193624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.000004651322,0.0000968095,0.217999,0.00001401931,0.00004325645,0.0002397649,0.00002346126,0.0008581349,0.7807209],"genre_scores_gemma":[0.003573169,0.00003032132,0.1554652,0.00007501178,0.0002070433,0.00001520584,0.0001926368,0.0003669006,0.8400745],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.8061082,"threshold_uncertainty_score":0.9999142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01383972761132562,"score_gpt":0.2045635052047349,"score_spread":0.1907237775934093,"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."}}