{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004915711,0.0001251862,0.0001448993,0.0000720345,0.0005586729,0.0001578057,0.0001523852,0.00002971706,0.00001891879],"category_scores_gemma":[0.00001513864,0.00008829535,0.00003201687,0.00002983413,0.00003216576,0.0001568279,0.0001019612,0.0005366683,9.506143e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003257363,"about_ca_system_score_gemma":0.00001181878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007406098,"about_ca_topic_score_gemma":0.000002077675,"domain_scores_codex":[0.999279,0.00002948876,0.0002462962,0.00007114169,0.0001880512,0.0001860559],"domain_scores_gemma":[0.9994481,0.0003127045,0.00008020738,0.00008364615,0.00001422459,0.00006113313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000006835518,0.000004004917,0.0002016366,0.00001493782,0.00004471024,0.00003216981,0.004799167,0.001388376,0.00009248101,0.001154555,0.0005261335,0.991735],"study_design_scores_gemma":[0.003440262,0.001752654,0.04947397,0.001370849,0.0001591682,0.009086054,0.04764501,0.304719,0.002611219,0.04178596,0.535366,0.0025899],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9687133,0.01643998,0.002676616,0.0009857806,0.0004726927,0.0001086461,0.00001060795,0.0003402503,0.01025214],"genre_scores_gemma":[0.9955773,0.003350438,0.0002968742,0.0004161329,0.0003154369,0.000002324489,0.000002747368,0.00001815298,0.00002055694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9891451,"threshold_uncertainty_score":0.4296917,"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."}}