{"id":"W2144303296","doi":"10.1287/ijoc.1090.0341","title":"Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"Kronos (Canada); HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Mathematical optimization; Computer science; Speedup; Constrained Shortest Path First; Shortest path problem; Vehicle routing problem; Path (computing); Scheduling (production processes); Routing (electronic design automation); Context (archaeology); Longest path problem; K shortest path routing; Mathematics; Parallel computing; Theoretical computer science; 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.0007815429,0.0007786478,0.0004929601,0.0009233327,0.0005305174,0.0007246328,0.0009816057,0.0007074633,0.006392532],"category_scores_gemma":[0.004045456,0.0003634618,0.0005269389,0.001442251,0.0007464354,0.001534971,0.0007547814,0.001346581,0.000770723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008774173,"about_ca_system_score_gemma":0.001376917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004828251,"about_ca_topic_score_gemma":0.006129604,"domain_scores_codex":[0.9993641,0.0002458319,0.00001548154,0.00005293286,0.0002580198,0.00006360163],"domain_scores_gemma":[0.9991112,0.0005660652,0.00006736421,0.0001112047,0.0001201477,0.00002383935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001183922,0.00009370592,0.0004219424,0.0001479828,0.00003555448,0.00008307785,0.00007155813,0.6673808,0.002853401,0.1818548,0.00432492,0.1426139],"study_design_scores_gemma":[0.00002656531,0.00005855262,0.0002166469,0.00001916416,0.00002097413,0.00005358057,0.0000184731,0.9011753,0.002481946,0.09069688,0.005215892,0.0000159167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01799638,0.0003531945,0.9749463,0.0002944096,0.00005685243,0.00007764087,0.0001116824,0.0002892322,0.005874174],"genre_scores_gemma":[0.3132844,0.000719815,0.6762821,0.000122791,0.00006280886,0.0003550663,0.0003091658,0.0003204954,0.00854332],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006392532,"threshold_uncertainty_score":0.02138519,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01740939486299027,"score_gpt":0.2875494768532688,"score_spread":0.2701400819902785,"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."}}