{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001658173,0.0003182217,0.000308507,0.0001033316,0.0006257251,0.0001974523,0.0004435557,0.0005098442,0.0006375088],"category_scores_gemma":[0.0003342977,0.0002995676,0.0001716519,0.0006809369,0.0002366765,0.0002048108,0.00005740068,0.0008303928,0.00007880435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004178076,"about_ca_system_score_gemma":0.0001173159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002893749,"about_ca_topic_score_gemma":0.00001053545,"domain_scores_codex":[0.9978212,0.0003031814,0.000412729,0.0003633261,0.0002442055,0.000855353],"domain_scores_gemma":[0.9973318,0.001688848,0.00006519681,0.000560289,0.0001780099,0.0001758878],"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.0000399879,0.00005267054,0.001532962,0.00019133,0.0002014476,0.00001700085,0.001837829,0.4709587,0.0003669506,0.4233444,0.00315132,0.09830549],"study_design_scores_gemma":[0.0009718875,0.00007773652,0.0005069968,0.00006431316,0.0001387003,0.0001099388,0.0005259622,0.7232456,0.0008713951,0.02216105,0.2508945,0.0004318669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00314008,0.005291737,0.964152,0.01241037,0.002382684,0.0007013263,0.0000481239,0.0002796446,0.01159399],"genre_scores_gemma":[0.0291322,0.002477469,0.944663,0.0009333138,0.002039955,0.0001389898,0.00003065486,0.0002233869,0.02036104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4011833,"threshold_uncertainty_score":0.9999456,"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."}}