{"id":"W2070890709","doi":"10.1007/s10878-007-9109-x","title":"An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"Iran National Science Foundation","keywords":"Arc routing; Subgradient method; Theory of computation; Mathematical optimization; Linear programming relaxation; Integer programming; Mathematics; Context (archaeology); Relaxation (psychology); Extension (predicate logic); Lagrangian relaxation; Algorithm; Linear programming; Branch and cut; Computer science; Routing (electronic design automation)","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.002795251,0.0001370642,0.0003225955,0.000224865,0.0001101202,0.00002640782,0.0001620752,0.0001543964,0.000008090428],"category_scores_gemma":[0.000789983,0.0001178207,0.0001352508,0.0005355919,0.00004371945,0.0004118567,0.00001654128,0.0002134623,6.658638e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001389917,"about_ca_system_score_gemma":0.00006739046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008988626,"about_ca_topic_score_gemma":0.000001543241,"domain_scores_codex":[0.9981234,0.0001163242,0.001153999,0.0001021734,0.0003190249,0.0001850831],"domain_scores_gemma":[0.9969873,0.0002854264,0.001159025,0.0001865216,0.001312559,0.00006910197],"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.00005081711,0.00007553225,0.0001144882,0.0000473367,0.00003481939,0.000006064998,0.001167783,0.9805858,0.007410305,0.0006593871,0.00002790393,0.00981973],"study_design_scores_gemma":[0.001640821,0.0002464987,0.0001561369,0.0001725306,0.00007720055,0.0001398723,0.000264847,0.973718,0.02266228,0.0007918027,0.00001530745,0.0001147397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09264158,0.0000313686,0.9030418,0.00001374442,0.003824301,0.0003258294,0.000005135001,0.00002720632,0.00008901257],"genre_scores_gemma":[0.5733537,0.00001158396,0.4258913,0.000002834062,0.0007024083,0.000001100627,0.000003928681,0.000030779,0.000002425995],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4807121,"threshold_uncertainty_score":0.4804587,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01502040943728694,"score_gpt":0.2665742300886776,"score_spread":0.2515538206513906,"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."}}