{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001792853,0.001465526,0.001770199,0.001511701,0.001185904,0.001701561,0.002370074,0.001883811,0.01079492],"category_scores_gemma":[0.004337989,0.0007433837,0.001001488,0.002512438,0.0007776868,0.002456035,0.001518244,0.002123243,0.001747068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002030412,"about_ca_system_score_gemma":0.00377047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006908005,"about_ca_topic_score_gemma":0.007001614,"domain_scores_codex":[0.9989562,0.0002915114,0.00005208578,0.0002311448,0.0002707583,0.0001982533],"domain_scores_gemma":[0.9984785,0.0009282894,0.0001418347,0.0001508225,0.0001735278,0.0001270247],"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.0003717621,0.0004824923,0.0007709963,0.0002175235,0.00007263193,0.0001671895,0.0001566423,0.6147696,0.002917672,0.05257383,0.01586613,0.3116336],"study_design_scores_gemma":[0.0001281257,0.00009370819,0.0001207155,0.00001356842,0.00001863012,0.00005360218,0.00002639483,0.9688274,0.0006168836,0.0280902,0.001998197,0.00001251392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01850832,0.0003208955,0.9709231,0.0005814379,0.00007634318,0.0003528809,0.0002846791,0.00143549,0.007516802],"genre_scores_gemma":[0.09947911,0.000231084,0.8951567,0.0001629403,0.00007325254,0.0004974565,0.0007490569,0.0002857505,0.003364794],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01079492,"threshold_uncertainty_score":0.03611255,"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."}}