{"id":"W2902000811","doi":"10.1016/j.ejor.2020.09.017","title":"An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs","year":2020,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"Universitetet i Bergen; Türkiye Bilimler Akademisi","keywords":"Graph coloring; Fractional coloring; Combinatorics; Greedy coloring; Perfect graph; Mathematics; List coloring; Complete coloring; Graph partition; Discrete mathematics; Graph; Algorithm; Computer science; 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.0006085386,0.0009277712,0.0008906421,0.0008066092,0.0005271424,0.001088505,0.00166207,0.001105623,0.006853569],"category_scores_gemma":[0.00231777,0.0005603411,0.0006994038,0.001720282,0.0004919966,0.001340355,0.0009947713,0.001202021,0.0006299804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009338394,"about_ca_system_score_gemma":0.002115621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00585667,"about_ca_topic_score_gemma":0.006516755,"domain_scores_codex":[0.9996094,0.00007257893,0.00001925951,0.00009386054,0.0001084821,0.00009646779],"domain_scores_gemma":[0.9992356,0.0004576253,0.00005397848,0.0001282861,0.00007476209,0.00004972275],"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.0004281412,0.0003333041,0.0008332416,0.0003194269,0.00007659332,0.0001065138,0.0001146924,0.5867935,0.007153282,0.03819305,0.0117435,0.3539048],"study_design_scores_gemma":[0.00009379088,0.00006800532,0.0002416092,0.000009572117,0.00002091712,0.00004031827,0.00003067866,0.9736318,0.00109449,0.02340029,0.001362631,0.000005974606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07098082,0.000376398,0.914159,0.0003795285,0.0001327657,0.0001851496,0.0004499625,0.001363964,0.01197238],"genre_scores_gemma":[0.2434048,0.0002755803,0.7506455,0.0001379245,0.00006266161,0.0002227644,0.0008534365,0.0001755146,0.004221775],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006853569,"threshold_uncertainty_score":0.02292752,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2901923381441248,"score_gpt":0.4730422828480221,"score_spread":0.1828499447038973,"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."}}