{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007244186,0.00021617,0.0003041626,0.0001749228,0.0001136059,0.0001126787,0.001279065,0.0001432815,0.000004677443],"category_scores_gemma":[0.00002390224,0.0001797316,0.0001498228,0.0004808192,0.00004781839,0.0003929567,0.0003242297,0.0004210363,0.000005611218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005069048,"about_ca_system_score_gemma":0.0001009344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008278016,"about_ca_topic_score_gemma":0.000002592119,"domain_scores_codex":[0.9984306,0.00006036809,0.0003448882,0.0004667092,0.0002884472,0.0004089934],"domain_scores_gemma":[0.9983016,0.0005648472,0.0000911469,0.0007716863,0.0001585342,0.0001121953],"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.0001037289,0.0003297332,0.0001901167,0.00007684868,0.0001472541,0.000008007441,0.001646728,0.6827967,0.007610056,0.06046403,0.0002995169,0.2463273],"study_design_scores_gemma":[0.001201742,0.0005804849,0.000291634,0.000119276,0.000008169277,0.000007852175,0.00006498013,0.9923078,0.003436158,0.0002321609,0.001525465,0.0002242374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0275436,0.00007545533,0.9691991,0.0002187408,0.001789281,0.0009843211,0.00001033581,0.0001675332,0.00001169001],"genre_scores_gemma":[0.6994063,0.000007091698,0.300052,0.00005872629,0.0003859161,0.00003616599,0.00000645207,0.00002697383,0.00002033664],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6718627,"threshold_uncertainty_score":0.7329242,"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."}}