{"id":"W2940838630","doi":"10.1016/j.cie.2019.04.040","title":"An extension of adaptive multi-start tabu search for the maximum quasi-clique problem","year":2019,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Clique problem; Tabu search; Clique; Extension (predicate logic); Clique percolation method; Mathematics; Cardinality (data modeling); Benchmark (surveying); Heuristic; Algorithm; Mathematical optimization; Graph; Computer science; Combinatorics; Complex network; Pathwidth; Line graph; Data mining","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.00120958,0.0005729992,0.001141835,0.001161166,0.0007562501,0.0008616881,0.002788429,0.001183993,0.00811758],"category_scores_gemma":[0.004230623,0.0004162825,0.001233123,0.001856115,0.0006845865,0.001534722,0.001446654,0.001511519,0.001076441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007123509,"about_ca_system_score_gemma":0.001816504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004387947,"about_ca_topic_score_gemma":0.005440465,"domain_scores_codex":[0.9991181,0.0003658747,0.00002658308,0.0001632672,0.0002178533,0.0001083027],"domain_scores_gemma":[0.9985136,0.0007973342,0.00007307385,0.0002723394,0.0002548814,0.00008877034],"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.0004978431,0.0005106737,0.001182671,0.0004388908,0.0001327405,0.0001397208,0.0001603159,0.6090277,0.005648911,0.07076178,0.01376763,0.2977311],"study_design_scores_gemma":[0.00004318964,0.00007080125,0.000229995,0.0000178754,0.00001663077,0.00003506598,0.000009355392,0.9806973,0.0004829471,0.01589624,0.002491216,0.000009388747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03292263,0.0006042511,0.9499504,0.0003861136,0.0003008379,0.0002795075,0.0003024232,0.001116833,0.01413696],"genre_scores_gemma":[0.3073411,0.0004573821,0.6833788,0.0003317626,0.0002472482,0.0003324865,0.0005641246,0.0004256986,0.006921407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00811758,"threshold_uncertainty_score":0.02715605,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07725742536160617,"score_gpt":0.2692865235304725,"score_spread":0.1920290981688663,"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."}}