{"id":"W1998193115","doi":"10.1007/s10479-010-0715-0","title":"Using local search to speed up filtering algorithms for some NP-hard constraints","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Theory of computation; Local search (optimization); Algorithm; Computer science; Local consistency; Filter (signal processing); Consistency (knowledge bases); Computational complexity theory; Graph; Search tree; Search algorithm; Substructure; Constraint (computer-aided design); Guided Local Search; Mathematical optimization; Mathematics; Constraint satisfaction problem; 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.003903651,0.001791686,0.002553742,0.001882123,0.001059999,0.00179009,0.002023133,0.003100199,0.008754753],"category_scores_gemma":[0.01533418,0.001450698,0.001530972,0.001783754,0.001253398,0.003718213,0.001500597,0.003196025,0.00124587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00126643,"about_ca_system_score_gemma":0.001998097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008549551,"about_ca_topic_score_gemma":0.01071705,"domain_scores_codex":[0.9988229,0.0004027396,0.000066348,0.0002337749,0.0002967987,0.000177487],"domain_scores_gemma":[0.9866812,0.01165104,0.000361948,0.0004904518,0.0006498737,0.0001654682],"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.0002819207,0.0002791438,0.0006054217,0.0002592654,0.00009278052,0.0001283619,0.0001146506,0.8211501,0.001986187,0.01708429,0.007662884,0.1503548],"study_design_scores_gemma":[0.00003452733,0.00002885282,0.00003897949,0.000008396808,0.00001128319,0.00001186428,0.000008383487,0.9941118,0.0003250775,0.005106513,0.0003102003,0.000004062089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01301638,0.000355171,0.9830312,0.0002765429,0.0001160257,0.00007840172,0.00005837061,0.0008400739,0.002227874],"genre_scores_gemma":[0.237697,0.0003202237,0.7538303,0.000477116,0.0002045971,0.0004797813,0.0003889099,0.0004590975,0.006142944],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008754753,"threshold_uncertainty_score":0.02928758,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.400891667993072,"score_gpt":0.5075783819447462,"score_spread":0.1066867139516743,"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."}}