{"id":"W1994932713","doi":"10.1007/s10479-008-0481-4","title":"A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Direktion für Entwicklung und Zusammenarbeit","keywords":"Mathematics; Semidefinite programming; Rounding; Partition (number theory); Combinatorics; Hyperplane; Disjoint sets; Algorithm; Graph partition; Maximum cut; Partition problem; Branch and cut; Integer programming; Graph; Computer science; Mathematical optimization","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.001570034,0.00009129822,0.00012072,0.0002531313,0.001231958,0.0001950754,0.000518542,0.00004361048,0.00001257267],"category_scores_gemma":[0.0002160909,0.00006807773,0.00007936538,0.0007803746,0.0003335291,0.0002964442,0.0001257256,0.000215989,0.000008513151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008076656,"about_ca_system_score_gemma":0.0001781466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009648847,"about_ca_topic_score_gemma":0.00004360321,"domain_scores_codex":[0.9984079,0.0001695961,0.0002351929,0.0002954118,0.0005387861,0.0003531069],"domain_scores_gemma":[0.9977934,0.0008982052,0.00002312028,0.0004575788,0.0007529793,0.00007470979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005667381,0.000813117,0.0001345275,0.00009810632,0.00006794909,0.00001030088,0.002769313,0.01167904,0.00069147,0.184471,0.01029149,0.7889171],"study_design_scores_gemma":[0.000315803,0.0006057968,0.000485766,0.00005555167,0.000002149302,0.00001016689,0.00004439236,0.9744681,0.004618851,0.005433945,0.01385271,0.0001068362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009432294,0.0003707122,0.9674453,0.02045089,0.00008082551,0.001454611,0.00003738709,0.00006633398,0.0006616978],"genre_scores_gemma":[0.7092479,0.0003615828,0.2878402,0.0007837821,0.0001500324,0.0009945646,0.00002509938,0.0000163999,0.0005804499],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.962789,"threshold_uncertainty_score":0.9475346,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2635310348025377,"score_gpt":0.4164277997338451,"score_spread":0.1528967649313074,"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."}}