{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002443166,0.0007077449,0.0008829945,0.0007485877,0.0005598883,0.001025663,0.001242247,0.001167361,0.004383085],"category_scores_gemma":[0.007377818,0.0003574731,0.0005529899,0.000908375,0.0007383227,0.0009623423,0.0008682126,0.00143749,0.0002786219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001013423,"about_ca_system_score_gemma":0.001445937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003234144,"about_ca_topic_score_gemma":0.002622081,"domain_scores_codex":[0.9994116,0.0003344668,0.00001698773,0.00006959014,0.00009414405,0.00007325879],"domain_scores_gemma":[0.9928664,0.006270451,0.0002348383,0.0001575788,0.0002716333,0.0001991271],"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.0003460065,0.0001852403,0.001199453,0.0001546021,0.00003486164,0.00005851056,0.00007727882,0.9374374,0.0014313,0.02354426,0.001373588,0.03415751],"study_design_scores_gemma":[0.00002456888,0.00003094471,0.00006617733,0.000005782544,0.000003949886,0.000007725274,0.000009185879,0.9965577,0.0001476007,0.003033084,0.0001118457,0.000001439086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3231077,0.0007460418,0.6558977,0.0008630886,0.00008501644,0.0002648993,0.0001754513,0.0006553361,0.01820478],"genre_scores_gemma":[0.6140191,0.0001883437,0.3833448,0.00011889,0.00003338086,0.0002392169,0.0002421945,0.0001115022,0.001702563],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004383085,"threshold_uncertainty_score":0.01466286,"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."}}