{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003166171,0.001794728,0.0009516303,0.0005778078,0.0004500997,0.001258772,0.001636129,0.0009412984,0.01507128],"category_scores_gemma":[0.0008206165,0.0006845122,0.0006255147,0.001949895,0.0006275606,0.002339791,0.0007868189,0.002114314,0.004514875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007612286,"about_ca_system_score_gemma":0.0008742882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00152746,"about_ca_topic_score_gemma":0.002970376,"domain_scores_codex":[0.9997302,0.00005257722,0.000009353208,0.00005250721,0.0001323908,0.00002300669],"domain_scores_gemma":[0.9998392,0.00008955449,0.000008737496,0.000023606,0.0000314736,0.000007497598],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002303513,0.00007275205,0.00007409356,0.000577942,0.0000370475,0.00008281735,0.00009112986,0.1479068,0.001738204,0.3607278,0.09495655,0.3937118],"study_design_scores_gemma":[0.00002061132,0.00003169139,0.0001377932,0.0002001775,0.00002593054,0.000187727,0.00006767105,0.1869359,0.001728641,0.4945023,0.316135,0.00002653648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002612327,0.007043863,0.7845934,0.0009537805,0.0008557276,0.00008242282,0.0003845134,0.0004733075,0.2030007],"genre_scores_gemma":[0.05265585,0.02124572,0.6310285,0.0004067144,0.000773782,0.0003974341,0.001467905,0.00079602,0.2912281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01507128,"threshold_uncertainty_score":0.05041844,"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."}}