{"id":"W4310251946","doi":"10.1287/ijoc.2022.1248","title":"Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Integer programming; Branch and bound; Cutting-plane method; Branch and cut; Tree (set theory); Computer science; Simple (philosophy); Operations research; Linear programming; Search tree; Upper and lower bounds; Integer (computer science); Mathematical optimization; Algorithm; Mathematics; Combinatorics; Programming language; Epistemology","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.008900562,0.00133307,0.001346792,0.001270417,0.001421052,0.006653212,0.003114326,0.003603375,0.01108002],"category_scores_gemma":[0.03493334,0.001310838,0.001481622,0.002972099,0.003009451,0.01070134,0.003862154,0.01282811,0.004057672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001183367,"about_ca_system_score_gemma":0.002537909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001234504,"about_ca_topic_score_gemma":0.001352489,"domain_scores_codex":[0.9929322,0.003287313,0.0002988976,0.0006077094,0.002509923,0.0003639647],"domain_scores_gemma":[0.9800417,0.016532,0.0005701442,0.001254266,0.001299078,0.0003029061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001513723,0.000126242,0.0005154741,0.0008076536,0.0000422205,0.0002462166,0.0004201103,0.0682056,0.001040304,0.5817242,0.02719713,0.3195235],"study_design_scores_gemma":[0.00004012995,0.00009628053,0.0001599085,0.0004560977,0.00001548804,0.0002421227,0.0002977697,0.09036665,0.001172938,0.8574009,0.04971718,0.0000344942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005567994,0.009296783,0.9448588,0.01632756,0.0009053367,0.0001686691,0.0001737957,0.0003218448,0.02237921],"genre_scores_gemma":[0.09955859,0.02411187,0.8593238,0.003898798,0.001921745,0.0006318951,0.0008827905,0.001028085,0.00864238],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01108002,"threshold_uncertainty_score":0.04707128,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05094025746411535,"score_gpt":0.2295837514378738,"score_spread":0.1786434939737584,"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."}}