{"id":"W4394009907","doi":"10.1007/s10107-024-02080-5","title":"Compressing branch-and-bound trees","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and bound; Upper and lower bounds; Mathematics; Branching (polymer chemistry); Tree (set theory); Combinatorics; Branch and cut; Heuristic; Search tree; Compression (physics); Integer programming; Algorithm; Discrete mathematics; Mathematical optimization; Search algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001727492,0.00091315,0.001625224,0.002452902,0.0009495509,0.002139453,0.001801269,0.001170722,0.01174914],"category_scores_gemma":[0.01855463,0.000861228,0.001369414,0.003622451,0.001366382,0.005925966,0.002784764,0.003100907,0.002361892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001552035,"about_ca_system_score_gemma":0.002869889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00398706,"about_ca_topic_score_gemma":0.007360235,"domain_scores_codex":[0.9974915,0.0005579136,0.0001441965,0.0003334208,0.001146377,0.0003265689],"domain_scores_gemma":[0.9877588,0.007921702,0.0004162776,0.002754333,0.0009038938,0.0002450936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000827483,0.0003175577,0.001716207,0.0006689384,0.00009227957,0.000256921,0.0005541623,0.237645,0.008721586,0.2235998,0.01749698,0.5081031],"study_design_scores_gemma":[0.00008938624,0.00009908526,0.00029622,0.0001102715,0.00006630734,0.00007240306,0.000120816,0.527945,0.006746089,0.4522524,0.01217832,0.00002372218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08518013,0.001193497,0.8900084,0.001629225,0.0003374032,0.0002958227,0.001708674,0.005103453,0.01454329],"genre_scores_gemma":[0.3925232,0.001002543,0.5876303,0.0005504474,0.0001762779,0.0004089281,0.003805161,0.001817065,0.01208604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01174914,"threshold_uncertainty_score":0.03930479,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04155383899727631,"score_gpt":0.3275159605329665,"score_spread":0.2859621215356902,"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."}}