{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003174808,0.001630798,0.001408514,0.0008473384,0.0004488024,0.001794329,0.001710937,0.001447662,0.004648154],"category_scores_gemma":[0.01209713,0.0009211822,0.00111412,0.00124547,0.001185913,0.002886873,0.001824772,0.002908343,0.0007762142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009739881,"about_ca_system_score_gemma":0.001397881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002950228,"about_ca_topic_score_gemma":0.002930469,"domain_scores_codex":[0.9983441,0.0008151653,0.00006274219,0.0002433276,0.000312504,0.0002221629],"domain_scores_gemma":[0.9915162,0.006620141,0.0005932451,0.0004867621,0.0005683912,0.0002151975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001956829,0.0002257304,0.0004533353,0.0002618611,0.00005420885,0.0001129369,0.00008644731,0.9335016,0.002720571,0.02593203,0.003624449,0.03283111],"study_design_scores_gemma":[0.0000240713,0.00005676002,0.00007686458,0.00001902263,0.000006894984,0.00003563983,0.00002011359,0.9858708,0.0008294266,0.01244809,0.0006053929,0.000006930591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06906226,0.0007040336,0.9167733,0.0006528433,0.00009255967,0.0001063311,0.0002482874,0.0005584363,0.01180202],"genre_scores_gemma":[0.4822018,0.0006003758,0.5106891,0.0005120133,0.0001168757,0.0002263415,0.0008288387,0.0004355353,0.004389104],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004648154,"threshold_uncertainty_score":0.01679021,"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."}}