{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559339,0.0005592273,0.001618023,0.001144323,0.0008814512,0.001057105,0.001782161,0.001405543,0.005633037],"category_scores_gemma":[0.008554674,0.000681702,0.0007455539,0.001402066,0.001202032,0.002156974,0.001580899,0.001480942,0.0004612184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001243341,"about_ca_system_score_gemma":0.0011448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004571136,"about_ca_topic_score_gemma":0.005538494,"domain_scores_codex":[0.9993006,0.0004329047,0.00001190132,0.0001107178,0.0000863582,0.00005745388],"domain_scores_gemma":[0.9967614,0.002700953,0.0001213984,0.0001266665,0.0001787477,0.000110822],"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.000205201,0.00009950445,0.0005608365,0.0001828752,0.00007729354,0.00004954434,0.0001313934,0.7015879,0.0006407545,0.2385297,0.008691085,0.04924399],"study_design_scores_gemma":[0.00002849242,0.0000143143,0.00008134488,0.00001146875,0.000006614657,0.000008704983,0.00001396037,0.9223863,0.00007994944,0.0763284,0.001036152,0.000004324141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0319482,0.0008722923,0.9558251,0.0009358168,0.00009184735,0.00007830068,0.0001728004,0.0001543979,0.00992109],"genre_scores_gemma":[0.5493489,0.0009187349,0.4299784,0.0003074392,0.000229887,0.0004986591,0.0006615951,0.0002939996,0.01776246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005633037,"threshold_uncertainty_score":0.01884437,"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."}}