{"id":"W3000089047","doi":"","title":"Improving the linear relaxation of maximum \\(k\\)-cut with semidefinite-based constraints","year":2018,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Semidefinite programming; Cutting-plane method; Mathematics; Maximum cut; Linear programming; Combinatorics; Relaxation (psychology); Semidefinite embedding; Vertex (graph theory); Linear programming relaxation; Graph; Interior point method; Feasible region; Set (abstract data type); Facet (psychology); Mathematical optimization; Integer programming; Computer science; Quadratically constrained quadratic program","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003701952,0.0001311802,0.000138763,0.00009674082,0.0003774553,0.00006742954,0.0006253893,0.00007838758,0.00002171945],"category_scores_gemma":[0.00009301888,0.00009019976,0.0000644742,0.0004642198,0.001414043,0.0001717954,0.00006954426,0.0002337562,0.00001240911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003354553,"about_ca_system_score_gemma":0.0001089786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008796185,"about_ca_topic_score_gemma":0.00003492484,"domain_scores_codex":[0.9989356,0.00008198124,0.0002099977,0.0002756556,0.0002760833,0.000220657],"domain_scores_gemma":[0.9987828,0.000253433,0.0002017861,0.0005368447,0.0001726081,0.00005250263],"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.000106092,0.0001748093,0.004271853,0.00009144549,0.00009959014,0.00004089317,0.007066824,0.0002445437,0.003893875,0.6290427,0.0005410861,0.3544263],"study_design_scores_gemma":[0.004660724,0.002553783,0.01288501,0.0003318908,0.0001105221,0.0002545748,0.001169985,0.7379526,0.09923492,0.1291838,0.01012744,0.001534738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1787528,0.00003264063,0.8186197,0.0008645655,0.0002330847,0.000142622,0.000006770284,0.0001025446,0.00124528],"genre_scores_gemma":[0.8121702,0.000002975268,0.1870922,0.0005485347,0.000122193,0.000007252628,0.000003441885,0.000008578148,0.00004467053],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.737708,"threshold_uncertainty_score":0.5210102,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01272035651545259,"score_gpt":0.2098328919479584,"score_spread":0.1971125354325058,"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."}}