{"id":"W1998243034","doi":"10.1016/j.dam.2003.09.012","title":"Variable neighborhood search for the maximum clique","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Clique; Heuristic; Variable neighborhood search; Clique problem; Vertex (graph theory); Greedy algorithm; Mathematical optimization; Simplicity; Combinatorics; Variable (mathematics); Algorithm; Metaheuristic; Graph; Chordal graph","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.0005996393,0.000176041,0.0002008609,0.00004041966,0.0001502964,0.00007834363,0.0002935613,0.000099827,0.00003738424],"category_scores_gemma":[0.00004671484,0.0001331332,0.00006022155,0.0002471214,0.00003979004,0.00004924091,0.00004942016,0.000183981,0.00003636561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006677627,"about_ca_system_score_gemma":0.00003688776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002240568,"about_ca_topic_score_gemma":6.104727e-7,"domain_scores_codex":[0.9990276,0.000007584381,0.0002904553,0.0001507011,0.0001814267,0.000342258],"domain_scores_gemma":[0.9990101,0.0004030047,0.00003813148,0.0004423522,0.0000439443,0.00006245692],"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.000002924261,0.00001566454,0.000001356087,0.0001823188,0.00004111444,2.070718e-7,0.0006687192,0.5281119,0.002306528,0.4674951,0.00006292982,0.00111128],"study_design_scores_gemma":[0.00104207,0.00002424406,0.00001099669,0.00005165802,0.00008787603,0.000007658733,0.0009725495,0.7018995,0.02340153,0.2710199,0.001116427,0.0003656114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006037512,0.00005001035,0.9717149,0.0001513314,0.0001029619,0.000740184,0.00001790639,0.0003681083,0.02625083],"genre_scores_gemma":[0.1238171,0.00002250688,0.8755813,0.00008722643,0.0001041944,0.0002232971,0.00001430246,0.00009758905,0.00005246521],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1964752,"threshold_uncertainty_score":0.5429015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01968403011513852,"score_gpt":0.2687723857027823,"score_spread":0.2490883555876438,"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."}}