{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001606253,0.001061166,0.001442888,0.0009851238,0.0007154295,0.001073461,0.002252392,0.001490189,0.007663967],"category_scores_gemma":[0.005623534,0.0008686549,0.001625222,0.001873043,0.0005869125,0.001927993,0.001406874,0.003368115,0.00170039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005141701,"about_ca_system_score_gemma":0.001515914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003436397,"about_ca_topic_score_gemma":0.003436697,"domain_scores_codex":[0.9990758,0.0003356509,0.00004740002,0.0001495174,0.0002567563,0.0001349088],"domain_scores_gemma":[0.9983241,0.0008961955,0.000106145,0.0002484173,0.0003362046,0.00008895549],"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.0003280428,0.0004779289,0.0007177861,0.000431765,0.0001569366,0.0002357634,0.0001775536,0.571278,0.005216527,0.06315898,0.02113537,0.3366853],"study_design_scores_gemma":[0.00003551965,0.00004673969,0.00008975402,0.00002095798,0.00001850528,0.00008802835,0.00001271374,0.9815264,0.0005964848,0.012335,0.00521798,0.0000118183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006307053,0.0003229283,0.9833725,0.0002978276,0.0002112241,0.00008504593,0.00009219587,0.0003622814,0.008949038],"genre_scores_gemma":[0.08107869,0.0005467604,0.9113604,0.0002321029,0.0002756795,0.0001910966,0.0003200331,0.0002910474,0.005704096],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007663967,"threshold_uncertainty_score":0.02563852,"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."}}