{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046388,0.0001050688,0.0001330577,0.00006931191,0.0001124054,0.001015104,0.0003106151,0.00004781034,0.00001238797],"category_scores_gemma":[0.0001744483,0.00008466493,0.00004425936,0.0002614222,0.000103279,0.0005303994,0.0001670996,0.0001438738,0.00009510409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002165005,"about_ca_system_score_gemma":0.00001516852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001519342,"about_ca_topic_score_gemma":3.007022e-7,"domain_scores_codex":[0.999018,0.00005315345,0.0002195037,0.0002764408,0.0002048857,0.0002280626],"domain_scores_gemma":[0.999292,0.0002973278,0.00002641841,0.0002918216,0.00001809371,0.00007429373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[3.71443e-7,0.00001536114,0.000004585368,0.0001481629,0.000005614829,0.000004221684,0.0006156667,0.000001343977,0.000469512,0.5023885,0.00001025428,0.4963364],"study_design_scores_gemma":[0.00006312121,0.00003904132,0.00008797028,0.0002892618,0.00001193485,0.0000690892,0.00003528305,0.7290617,0.00135904,0.2539311,0.01487952,0.0001729273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005359064,0.0007534476,0.9896079,0.0003489886,0.0001797748,0.0001572586,1.918331e-7,0.0006184836,0.002974836],"genre_scores_gemma":[0.3062301,0.000002669472,0.6935372,0.00002806924,0.00004089019,0.00002382011,3.417665e-7,0.000008900118,0.0001280528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7290604,"threshold_uncertainty_score":0.9788667,"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."}}