{"id":"W2404422255","doi":"10.1007/s10479-017-2448-9","title":"Computational study of valid inequalities for the maximum k-cut problem","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Clique; Mathematics; Vertex (graph theory); Combinatorics; Focus (optics); Graph; Set (abstract data type); Inequality; Relaxation (psychology); Semidefinite programming; Mathematical optimization; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.005528856,0.001613961,0.001720479,0.002322065,0.001877685,0.006325492,0.004880207,0.002161273,0.0206842],"category_scores_gemma":[0.05611717,0.001188042,0.002688559,0.003333183,0.003501395,0.009332165,0.003205855,0.006100262,0.0007999906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003262131,"about_ca_system_score_gemma":0.003930849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004872055,"about_ca_topic_score_gemma":0.007911202,"domain_scores_codex":[0.996192,0.001971024,0.0001806561,0.0004744602,0.0007332981,0.0004485453],"domain_scores_gemma":[0.878306,0.1129833,0.002624842,0.002621758,0.002205955,0.001257985],"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.001992565,0.001365893,0.007468879,0.001395818,0.0003247588,0.0004327905,0.0007791499,0.4694827,0.002183024,0.4073734,0.01970668,0.08749442],"study_design_scores_gemma":[0.0001387051,0.00009205268,0.000604393,0.00006483754,0.00007012583,0.00009956069,0.0001943358,0.7369211,0.0007332371,0.2598524,0.00120305,0.00002620911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3928471,0.002663022,0.5286546,0.01100925,0.0004877503,0.0006779192,0.003457162,0.0007145819,0.05948867],"genre_scores_gemma":[0.7790786,0.0008387241,0.2060967,0.0007907809,0.0004151249,0.0003883211,0.003377805,0.0003471844,0.008666799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0206842,"threshold_uncertainty_score":0.06919557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.5021551982509271,"score_gpt":0.5168750330118258,"score_spread":0.01471983476089866,"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."}}