{"id":"W3119461075","doi":"10.1109/access.2021.3051741","title":"A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Computer science; Algorithm; Guided Local Search; Evolutionary algorithm; Benchmark (surveying); Vertex cover; Robustness (evolution); Local search (optimization); Memetic algorithm; Mathematical optimization; Combinatorial optimization; Best-first search; Search algorithm; Mathematics; Approximation algorithm; Beam search; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0006349246,0.00134668,0.001187724,0.001591273,0.0007840624,0.001070987,0.001623966,0.001693755,0.003997796],"category_scores_gemma":[0.002591369,0.0004968634,0.001152056,0.001755828,0.0005039539,0.0008952897,0.000967898,0.001359302,0.001080826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008901113,"about_ca_system_score_gemma":0.001928965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004626869,"about_ca_topic_score_gemma":0.004872506,"domain_scores_codex":[0.9993068,0.0001555365,0.00003195581,0.0001503417,0.0002375739,0.0001178098],"domain_scores_gemma":[0.9995151,0.0002216387,0.00006414176,0.00006831138,0.0001008417,0.00003005155],"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.000116904,0.0001478968,0.0006818603,0.0002044444,0.00008688338,0.0001822416,0.00008439615,0.6656006,0.0048229,0.01666391,0.008843236,0.3025647],"study_design_scores_gemma":[0.00004688458,0.0000534636,0.000131474,0.00001775243,0.00001623186,0.00009655127,0.00002605128,0.9894034,0.001040007,0.005569425,0.00358849,0.00001028482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01770219,0.0007276095,0.9705366,0.0002512698,0.0001419551,0.000280645,0.0001690524,0.001836217,0.008354556],"genre_scores_gemma":[0.1933013,0.0005050074,0.7997645,0.0002463349,0.0001152276,0.0005524697,0.0008719307,0.0003093134,0.004333913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004626869,"threshold_uncertainty_score":0.01337397,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02594190401154969,"score_gpt":0.279889774208004,"score_spread":0.2539478701964544,"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."}}