{"id":"W2117319367","doi":"10.1007/s10107-011-0497-4","title":"Improved lower bounds and exact algorithm for the capacitated arc routing problem","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Column generation; Bounding overwatch; Benchmark (surveying); Mathematical optimization; Mathematics; Undirected graph; Set (abstract data type); Upper and lower bounds; Algorithm; Vehicle routing problem; Arc (geometry); Routing (electronic design automation); Graph; Computer science; Combinatorics; Artificial intelligence","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.003196622,0.002276201,0.00207285,0.002548871,0.001041078,0.003917069,0.004580826,0.00255753,0.01646158],"category_scores_gemma":[0.01437723,0.001302192,0.001674819,0.003726151,0.001440621,0.005193988,0.003117798,0.005986896,0.003415245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003306512,"about_ca_system_score_gemma":0.003636626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005464592,"about_ca_topic_score_gemma":0.007044054,"domain_scores_codex":[0.9968816,0.0008705944,0.0001210844,0.0004295064,0.00131343,0.0003838234],"domain_scores_gemma":[0.9940124,0.003629848,0.0002578581,0.0009573814,0.0009732467,0.0001692998],"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.0003586181,0.0003906994,0.0003898331,0.0003214222,0.00008047476,0.00007153097,0.0001446623,0.6220709,0.002603433,0.1372105,0.0198993,0.2164587],"study_design_scores_gemma":[0.00004932966,0.00003346679,0.0001085068,0.00002959852,0.00001879623,0.00003096123,0.00001701059,0.9423397,0.0007982882,0.05297862,0.003578509,0.00001716877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005524793,0.0007915018,0.9807755,0.0004609822,0.0002274604,0.00007509244,0.0001917622,0.000870471,0.01108248],"genre_scores_gemma":[0.1210908,0.0009563486,0.8645887,0.0004054994,0.0003824787,0.0004830007,0.0007652846,0.0007689095,0.01055893],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01646158,"threshold_uncertainty_score":0.05506945,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03169759203907864,"score_gpt":0.258755181753461,"score_spread":0.2270575897143823,"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."}}