{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041248,0.0001996692,0.000225178,0.00004214807,0.0002036267,0.0001442127,0.0001574415,0.00009683042,0.00003912918],"category_scores_gemma":[0.0002402894,0.0001450125,0.00007243138,0.0001776908,0.0001095546,0.0001194871,0.00004727764,0.0002012792,0.000005421942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003433709,"about_ca_system_score_gemma":0.000009495166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005682898,"about_ca_topic_score_gemma":0.000001113836,"domain_scores_codex":[0.9988196,0.00003613649,0.0003707642,0.000202062,0.0001208647,0.0004505914],"domain_scores_gemma":[0.9990694,0.0004773428,0.00005871189,0.0002299771,0.00006773342,0.00009686197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008145646,0.00008610311,0.00003990787,0.0003661904,0.0001380671,0.000002744009,0.00412125,0.0003336624,0.0005980683,0.004175756,0.00003243864,0.9900976],"study_design_scores_gemma":[0.0003144723,0.00006856392,0.00001932359,0.00006287597,0.0000607372,0.00001789782,0.0003704442,0.9935008,0.0007465067,0.004120925,0.0005069691,0.000210534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003098756,0.00008970134,0.993977,0.00003469069,0.0001035874,0.0009139939,0.000002712589,0.000547642,0.001231939],"genre_scores_gemma":[0.1426646,0.000003799034,0.8568762,0.00001752977,0.00005506791,0.000226306,0.000002185089,0.0000675741,0.00008679146],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9931671,"threshold_uncertainty_score":0.5913437,"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."}}