{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002500655,0.00006380304,0.0001375151,0.0001644771,0.001650992,0.0004124388,0.001828151,0.00002283316,0.0000143124],"category_scores_gemma":[0.0003856735,0.00004631899,0.00006239123,0.0002100251,0.0003311843,0.0004573494,0.0005441804,0.0001336448,0.000003135949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004354118,"about_ca_system_score_gemma":0.0001651168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008806332,"about_ca_topic_score_gemma":0.0003996806,"domain_scores_codex":[0.9984448,0.0001975217,0.000299102,0.0001956913,0.0006538811,0.0002090128],"domain_scores_gemma":[0.9964891,0.0007696196,0.00005847881,0.0008554382,0.001791517,0.00003581072],"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.00002523258,0.001031193,0.0007272792,0.00006265626,0.000134665,0.000001420794,0.009231118,0.05541032,0.00006567283,0.9056212,0.003284421,0.02440485],"study_design_scores_gemma":[0.0009442611,0.001729835,0.01570783,0.00005585084,0.000006794841,0.000003189228,0.003749262,0.6945211,0.002180566,0.2788074,0.002118882,0.0001750627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4065325,0.0002585464,0.5639283,0.0231617,0.0002200333,0.003065185,0.0001186733,0.00003913276,0.002675916],"genre_scores_gemma":[0.9818683,0.00002250152,0.01752576,0.00003767997,0.00004516064,0.0001554838,0.000003827453,0.000004299261,0.000337042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6391107,"threshold_uncertainty_score":0.9996487,"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."}}