{"id":"W2625613098","doi":"","title":"A Branch-and-Price Algorithm for the Robust Graph Coloring Problem","year":2011,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Edge coloring; Fractional coloring; Graph; Vertex (graph theory); Greedy coloring; Complete coloring; Discrete mathematics; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.005227475,0.0002993444,0.0003953925,0.000542446,0.001033915,0.0004625409,0.001189308,0.0002207336,0.00007277195],"category_scores_gemma":[0.001437797,0.0002052822,0.0002874138,0.001435092,0.000244742,0.0004277429,0.0002773127,0.0003990699,0.00003517753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009546032,"about_ca_system_score_gemma":0.0001908573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004130335,"about_ca_topic_score_gemma":0.0009694291,"domain_scores_codex":[0.9968483,0.0001639764,0.0007476625,0.0006847272,0.0007093399,0.0008459967],"domain_scores_gemma":[0.9959204,0.001906974,0.0003391462,0.001104689,0.0004203192,0.0003085012],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002359889,0.0006457845,0.04461705,0.00003043873,0.0003781101,0.00002394989,0.003947435,0.007170283,0.001335491,0.1590547,0.01323548,0.7693253],"study_design_scores_gemma":[0.001319647,0.0003508325,0.0888991,0.00006436646,0.0002067748,0.0002096861,0.001008,0.7039208,0.00375817,0.1839813,0.01544328,0.0008380191],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01379609,0.002211275,0.9784248,0.002729648,0.0002750898,0.00109275,0.000052932,0.000432744,0.0009847082],"genre_scores_gemma":[0.4013171,0.0001826601,0.5941227,0.001103127,0.0001825074,0.001192486,0.000003858005,0.00005081272,0.001844744],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7684873,"threshold_uncertainty_score":0.8371163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07599896732650815,"score_gpt":0.2963153579850985,"score_spread":0.2203163906585903,"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."}}