{"id":"W2808768722","doi":"10.1002/net.21826","title":"Integer programming formulations for minimum deficiency interval coloring","year":2018,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; National Science Foundation","keywords":"Mathematics; Combinatorics; Graph coloring; Discrete mathematics; Edge coloring; Interval graph; Fractional coloring; Integer programming; Greedy coloring; Vertex (graph theory); Graph; Line graph; Pathwidth; Graph power; Algorithm","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.002633563,0.001599792,0.001143673,0.0009585822,0.0004939566,0.00205683,0.00163052,0.001356619,0.004246611],"category_scores_gemma":[0.008590885,0.0007917642,0.001046576,0.001684177,0.001104138,0.002119278,0.001046901,0.002941615,0.0005066712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002054189,"about_ca_system_score_gemma":0.001688513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003080848,"about_ca_topic_score_gemma":0.003060996,"domain_scores_codex":[0.9988633,0.000483792,0.00005370957,0.000180646,0.0002824893,0.000136047],"domain_scores_gemma":[0.9959885,0.003101811,0.0002921973,0.000146723,0.0003700404,0.0001006236],"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.0000429565,0.00008698738,0.0003642983,0.0001357034,0.00001840368,0.00008148587,0.0001068321,0.838752,0.000599328,0.1407152,0.002382016,0.01671476],"study_design_scores_gemma":[0.00001397862,0.00002228135,0.00006596931,0.00002119287,0.000006151993,0.00002266476,0.00003180814,0.9451454,0.0001871898,0.05318689,0.001290495,0.000005950162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008373642,0.0003792962,0.9831674,0.000373767,0.00004917512,0.00008770276,0.0002615433,0.00006295031,0.0072445],"genre_scores_gemma":[0.2858448,0.001336067,0.7028193,0.0003145178,0.0001874617,0.0007978318,0.0007408851,0.0001725852,0.007786555],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004246611,"threshold_uncertainty_score":0.0149042,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02521422759990976,"score_gpt":0.2909210732592273,"score_spread":0.2657068456593175,"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."}}