{"id":"W2054151210","doi":"10.1016/j.orl.2004.11.011","title":"Accelerated label setting algorithms for the elementary resource constrained shortest path problem","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":196,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Shortest path problem; Path (computing); Constrained Shortest Path First; Mathematical optimization; Node (physics); Computer science; Algorithm; Longest path problem; K shortest path routing; Repetition (rhetorical device); Widest path problem; Mathematics; Theoretical computer science; 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.002568466,0.0001551458,0.0001249369,0.0001637095,0.0009643737,0.0003870409,0.0003556622,0.00005984633,0.0001332974],"category_scores_gemma":[0.0002387133,0.0001299765,0.00004083927,0.0006025989,0.0001386273,0.0002716691,0.00006390936,0.0004876012,0.00002482805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001945345,"about_ca_system_score_gemma":0.00006819993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003396267,"about_ca_topic_score_gemma":0.00004965158,"domain_scores_codex":[0.9981119,0.0002716625,0.0003547967,0.0002609044,0.000402219,0.0005985369],"domain_scores_gemma":[0.9985985,0.0007253788,0.00001316449,0.0003359428,0.0002311146,0.00009595731],"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.000004202593,0.00001959752,0.00005605896,0.00001163786,0.0000528439,0.000001545715,0.0004025568,0.8992649,0.03456663,0.0001518857,0.02230992,0.04315817],"study_design_scores_gemma":[0.0005328845,0.00002602433,0.00006110589,0.00002211197,0.00001026899,0.000005410705,0.0003108942,0.9639624,0.003784344,0.000003211942,0.03113097,0.0001504048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05594113,0.0002675346,0.8747395,0.06303556,0.0001262315,0.003300341,0.0001781147,0.0006403624,0.001771268],"genre_scores_gemma":[0.1824186,0.00004527558,0.813144,0.002030786,0.0006528466,0.0009088045,0.0002406398,0.0001026854,0.0004563871],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1264774,"threshold_uncertainty_score":0.741728,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07945066765209823,"score_gpt":0.3697209552786762,"score_spread":0.2902702876265779,"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."}}