{"id":"W2024143101","doi":"10.1016/j.cor.2006.05.014","title":"A graph coloring heuristic using partial solutions and a reactive tabu scheme","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":174,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Tabu search; Graph coloring; Heuristics; Greedy coloring; List coloring; Computer science; Benchmark (surveying); Mathematics; Heuristic; Fractional coloring; Graph; Algorithm; Combinatorics; Mathematical optimization; Graph power; Line 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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004676559,0.0001415145,0.00023766,0.0009962049,0.002916445,0.001280026,0.0004679478,0.00008747549,0.00005267847],"category_scores_gemma":[0.002292549,0.0001265008,0.00008536682,0.002568219,0.00056538,0.0004886162,0.0003949373,0.000478487,0.000144434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001218695,"about_ca_system_score_gemma":0.0003965509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001893067,"about_ca_topic_score_gemma":0.0004089366,"domain_scores_codex":[0.9961948,0.000653937,0.0005176909,0.0006542543,0.001275655,0.0007036017],"domain_scores_gemma":[0.9963014,0.001677396,0.00004070884,0.00056338,0.001223308,0.0001938569],"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.0000991214,0.0008671938,0.01263016,0.00001494165,0.0001568361,0.00007665722,0.001949626,0.6473322,0.04554032,0.2670789,0.01661672,0.007637321],"study_design_scores_gemma":[0.0004068034,0.00006776687,0.005601181,0.00003263626,0.00001382414,0.000040914,0.0003767857,0.9816648,0.0004448028,0.008035148,0.003130435,0.0001848613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6645482,0.000398279,0.3325284,0.001201178,0.0003246268,0.0003008701,0.0000189477,0.00006713056,0.0006124316],"genre_scores_gemma":[0.9415776,0.00001028685,0.05746266,0.00002954872,0.0003301121,0.00004424182,0.00001019007,0.00001350429,0.0005218933],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3343327,"threshold_uncertainty_score":0.9997568,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4308289758627579,"score_gpt":0.4947675758842449,"score_spread":0.06393860002148699,"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."}}