{"id":"W3013962532","doi":"","title":"Computational study of a branching algorithm for the maximum \\(k\\)-cut problem","year":2020,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Branch and bound; Maximum cut; Branching (polymer chemistry); Cutting-plane method; Algorithm; Mathematics; Mathematical optimization; Relaxation (psychology); Metaheuristic; Graph; Node (physics); Linear programming relaxation; Linear programming; Combinatorics; Integer programming","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.0002513771,0.0001130349,0.0001648105,0.00003533461,0.0001568811,0.00003081178,0.0001645437,0.00005263474,0.000009714307],"category_scores_gemma":[0.00005777948,0.00009675556,0.00005526419,0.0002181482,0.00003968191,0.00006141475,0.00001961014,0.0001795183,0.000001726128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000318223,"about_ca_system_score_gemma":0.00001256692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009396252,"about_ca_topic_score_gemma":0.00000174,"domain_scores_codex":[0.999244,0.0000608175,0.0002509298,0.0001406928,0.0001611912,0.0001423879],"domain_scores_gemma":[0.9993457,0.0003910875,0.0000529247,0.0001011651,0.00006176643,0.00004734848],"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.00000604248,0.00002756257,0.0002601877,0.0000460827,0.00009324931,0.000001109115,0.009175225,0.9089975,0.00005546166,0.0004441707,0.0002255956,0.0806678],"study_design_scores_gemma":[0.0008054757,0.00008435357,0.0004177965,0.000006002293,0.00003293262,0.000002629608,0.001147933,0.9958019,0.0000997962,0.0009232142,0.0005709587,0.0001069531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06130364,0.00007916002,0.9372042,0.0004037868,0.00009201125,0.0005802868,0.00001525226,0.0001889962,0.0001326062],"genre_scores_gemma":[0.4206885,0.000004342808,0.5789525,0.0001431953,0.0001176358,0.00004178159,0.00000727821,0.00003354248,0.00001121272],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3593849,"threshold_uncertainty_score":0.3945577,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01582555029809753,"score_gpt":0.2431856831745436,"score_spread":0.2273601328764461,"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."}}