{"id":"W2806899243","doi":"10.1007/978-3-319-93031-2_35","title":"The WeightedCircuitsLmax Constraint","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Travelling salesman problem; Constraint (computer-aided design); Computer science; Mathematical optimization; Relaxation (psychology); Bounded function; Graph; Constraint satisfaction problem; Bottleneck traveling salesman problem; 2-opt; Mathematics; Algorithm; Theoretical computer science; 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.0003787579,0.001093787,0.0005563717,0.0005180906,0.0006758486,0.001814724,0.001889427,0.001081694,0.06022099],"category_scores_gemma":[0.001623817,0.0004704242,0.0005893509,0.001209791,0.0006859135,0.003100603,0.001513786,0.0020572,0.01103097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008645266,"about_ca_system_score_gemma":0.0008732325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001204484,"about_ca_topic_score_gemma":0.003056116,"domain_scores_codex":[0.9994272,0.00008884985,0.00002410278,0.0001675576,0.0002026048,0.00008974429],"domain_scores_gemma":[0.999514,0.0001606856,0.00003362363,0.0001291241,0.0001374147,0.00002528425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001019536,0.00005324615,0.000210122,0.0005989553,0.00003400819,0.0002747209,0.00005759841,0.0299527,0.01113229,0.6701866,0.06499685,0.2224009],"study_design_scores_gemma":[0.00002773781,0.0001011585,0.0003950649,0.0002548215,0.00006353513,0.0009106801,0.00006565601,0.07846173,0.0169314,0.4381692,0.4645862,0.00003276237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007568189,0.001957487,0.5774182,0.001700646,0.001127438,0.0001108391,0.001540288,0.0006827824,0.4078942],"genre_scores_gemma":[0.3098708,0.006323902,0.2158506,0.002242815,0.0009149702,0.0006121132,0.003441734,0.002142234,0.4586008],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06022099,"threshold_uncertainty_score":0.2014593,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01652795363498932,"score_gpt":0.2461760220894484,"score_spread":0.2296480684544591,"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."}}