{"id":"W2004802557","doi":"10.1016/j.disopt.2008.10.004","title":"Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Vertex (graph theory); Polytope; Independent set; Graph; Algorithm; Discrete mathematics","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.003647642,0.003747964,0.003655403,0.002452759,0.001762226,0.006103266,0.004617876,0.003640699,0.01306453],"category_scores_gemma":[0.01569457,0.002483964,0.00397678,0.007210232,0.003035016,0.008708119,0.003229033,0.009220511,0.001752196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005601956,"about_ca_system_score_gemma":0.003122808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008639455,"about_ca_topic_score_gemma":0.006711199,"domain_scores_codex":[0.9971486,0.001087529,0.0001047231,0.000426314,0.0008045509,0.0004283846],"domain_scores_gemma":[0.9897065,0.008032206,0.0004717214,0.0007105263,0.0007570957,0.0003219377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002255582,0.0003394868,0.0003211116,0.0005890022,0.00008453647,0.00005601134,0.0003702871,0.4216376,0.0008932846,0.4698707,0.01992418,0.08568825],"study_design_scores_gemma":[0.0000485553,0.00007137011,0.000139124,0.00008399996,0.00004208701,0.00005117508,0.00007388063,0.6464001,0.0007721653,0.3471898,0.005097951,0.00002989418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009865524,0.001859677,0.9615523,0.001152315,0.0003791424,0.0002236196,0.0004022842,0.0002159786,0.02434907],"genre_scores_gemma":[0.2224928,0.006250053,0.7278253,0.001217121,0.001666828,0.001520837,0.001841347,0.001032607,0.03615311],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01306453,"threshold_uncertainty_score":0.04370522,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1211367297478479,"score_gpt":0.3512656153859113,"score_spread":0.2301288856380634,"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."}}