{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989408,0.0001271118,0.0002087108,0.0005002338,0.0002996888,0.000158824,0.0003227798,0.0001029232,0.0002443507],"category_scores_gemma":[0.0007633409,0.0001396348,0.00006705985,0.0006105062,0.0002475258,0.0002956628,0.0001121516,0.0004945618,0.00003713735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003137809,"about_ca_system_score_gemma":0.0001609078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007749744,"about_ca_topic_score_gemma":0.0000225085,"domain_scores_codex":[0.9981779,0.000144426,0.0003609859,0.0002520912,0.0004769739,0.0005876157],"domain_scores_gemma":[0.9979861,0.0002994569,0.000008898757,0.0003753767,0.001100267,0.0002298822],"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.00000886413,0.00001872524,0.00002046934,0.00004559383,0.00002454663,0.000001397248,0.0003178488,0.7112515,0.2673496,0.001468742,0.000563349,0.01892939],"study_design_scores_gemma":[0.000177627,0.00004986934,0.00008467542,0.00002317267,0.000002039705,0.000007821751,0.0001682163,0.736266,0.2625711,0.00004241781,0.0004942075,0.0001128111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3473949,0.00002297262,0.6505516,0.0006641248,0.0002778426,0.000592547,0.00008588439,0.00007366141,0.0003364995],"genre_scores_gemma":[0.6626284,0.00001862644,0.3366662,0.00006096606,0.0002082636,0.00003343333,0.00001887163,0.00005001391,0.0003152581],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3152335,"threshold_uncertainty_score":0.5694142,"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."}}