{"id":"W2747220382","doi":"","title":"Variable Neighborhood Search for the Maximum Clique","year":2001,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Heuristic; Mathematics; Clique; Variable neighborhood search; Greedy algorithm; Clique problem; Vertex (graph theory); Mathematical optimization; Simplicity; Variable (mathematics); Combinatorics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006751267,0.0003433766,0.0007308554,0.0006811169,0.0006017869,0.0005632403,0.0007916741,0.0006409104,0.003878164],"category_scores_gemma":[0.003170919,0.0002768003,0.000460829,0.001034698,0.0006814889,0.001067547,0.0009049368,0.000796826,0.0003986075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006358997,"about_ca_system_score_gemma":0.000835415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002486403,"about_ca_topic_score_gemma":0.003280127,"domain_scores_codex":[0.9995134,0.0002489163,0.000009254813,0.00008085593,0.00009779195,0.00004969561],"domain_scores_gemma":[0.9992905,0.0005064323,0.0000403033,0.00005556247,0.00007347618,0.00003374823],"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.0001287704,0.00008040743,0.0005719579,0.0001422916,0.00005234926,0.00006502135,0.00008190376,0.7417647,0.001832149,0.1376725,0.007754992,0.109853],"study_design_scores_gemma":[0.0000270713,0.00003287122,0.0001259452,0.00001172781,0.000006446121,0.00002861621,0.00001358734,0.9463064,0.0004112888,0.05035837,0.002671276,0.000006278838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0218722,0.0007151221,0.9691187,0.0003105642,0.00004993678,0.00007111351,0.00009963007,0.0002387425,0.00752406],"genre_scores_gemma":[0.4953447,0.0006589579,0.4961888,0.0002139663,0.0001138923,0.0003692402,0.000527454,0.0001999577,0.006382972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003878164,"threshold_uncertainty_score":0.01297379,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01852289698079633,"score_gpt":0.2606074575649365,"score_spread":0.2420845605841402,"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."}}