{"id":"W3173319990","doi":"10.1609/aaai.v35i5.16512","title":"Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies","year":2021,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"Institut de Valorisation des Données; Compute Canada; Canadian Institute for Advanced Research","keywords":"Branching (polymer chemistry); Generalization; Branch and bound; Computer science; Tree (set theory); Benchmark (surveying); Search tree; Integer programming; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; Search algorithm; Algorithm; Combinatorics","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.002245568,0.001254514,0.001297606,0.0006808258,0.0003951721,0.001056626,0.001591163,0.001608285,0.002334263],"category_scores_gemma":[0.01240269,0.0006422247,0.0006912315,0.0007421132,0.001064391,0.001876875,0.001479204,0.00292478,0.0006779152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001111815,"about_ca_system_score_gemma":0.001863452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003148647,"about_ca_topic_score_gemma":0.003257566,"domain_scores_codex":[0.9992419,0.0003148348,0.00004778283,0.000153873,0.0001420836,0.00009954153],"domain_scores_gemma":[0.9953805,0.003466195,0.0003456413,0.0003559858,0.0002917965,0.0001599271],"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.00004159172,0.00003995532,0.000563046,0.000029059,0.00001432007,0.00001561027,0.00002617724,0.9673144,0.0004759775,0.004672766,0.0005415222,0.02626577],"study_design_scores_gemma":[0.000004777346,0.00001095682,0.00001868103,0.000004434516,0.000001897673,0.000002867732,0.000001944503,0.9973739,0.0001494596,0.00232462,0.0001048257,0.000001590398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04598641,0.0004186722,0.9489362,0.0002956794,0.00005450133,0.00009648185,0.0000798621,0.001038937,0.003093259],"genre_scores_gemma":[0.7653028,0.0003637733,0.2312856,0.0003040924,0.00004951033,0.0003923919,0.0003340913,0.0002487714,0.001718967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003148647,"threshold_uncertainty_score":0.01187587,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03093705308793026,"score_gpt":0.3004092617432398,"score_spread":0.2694722086553095,"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."}}