{"id":"W2626158319","doi":"","title":"A Learning Optimization Algorithm in Graph Theory. Versatile Search for Extremal Graphs Using a Learning Algorithm","year":2009,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Algorithm; Variable neighborhood search; Heuristic; Computer science; Feature (linguistics); Optimization problem; Extremal optimization; Graph; Mathematics; Invariant (physics); Mathematical optimization; Theoretical computer science; Metaheuristic; Meta-optimization","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.001534887,0.001158038,0.001323577,0.001425703,0.0007314222,0.001093698,0.00148641,0.001514858,0.003830727],"category_scores_gemma":[0.003977463,0.0007008481,0.001088109,0.001709515,0.001498975,0.001645867,0.001693945,0.002114769,0.001406273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008503825,"about_ca_system_score_gemma":0.00109662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001842249,"about_ca_topic_score_gemma":0.002041832,"domain_scores_codex":[0.9991921,0.0003362683,0.00004097903,0.000178845,0.0002067522,0.00004507789],"domain_scores_gemma":[0.9988348,0.0007781918,0.0000831009,0.0001315227,0.000133782,0.00003853246],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000115572,0.0001256586,0.0009853831,0.0003068707,0.0001752174,0.00008512355,0.0001385605,0.4830511,0.003020647,0.1289126,0.009078287,0.3740049],"study_design_scores_gemma":[0.00003763479,0.00006192685,0.0001550166,0.0000303341,0.0000181523,0.00005355557,0.00001436699,0.9157287,0.0009373728,0.0784408,0.00450784,0.00001430222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001636469,0.0002845868,0.9959459,0.0001217615,0.00003085955,0.00004099224,0.0000333132,0.0003398128,0.001566234],"genre_scores_gemma":[0.05692541,0.0003828298,0.9388903,0.0001798754,0.00009013809,0.0002797149,0.0002034525,0.0002265676,0.002821662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003830727,"threshold_uncertainty_score":0.01281506,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.016419768284362,"score_gpt":0.2747208318595703,"score_spread":0.2583010635752083,"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."}}