{"id":"W4386139117","doi":"10.1287/ijoc.2022.0257","title":"A Numerically Exact Algorithm for the Bin-Packing Problem","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal","funders":"","keywords":"Bin packing problem; Algorithm; Computation; Enumeration; Set (abstract data type); Branch and cut; Bin; Exact solutions in general relativity; Integer (computer science); Mathematical optimization; Branch and bound; Set packing; Mathematics; Integer programming; Point (geometry); Key (lock); Computer science; Discrete mathematics","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.0009107144,0.001266706,0.001270318,0.00102908,0.0008943131,0.002223572,0.002123471,0.001733555,0.01645842],"category_scores_gemma":[0.005381206,0.0006277637,0.0009536585,0.001691356,0.000913387,0.002275994,0.002060755,0.002853099,0.004617448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001357592,"about_ca_system_score_gemma":0.002895853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002978763,"about_ca_topic_score_gemma":0.003527489,"domain_scores_codex":[0.9990377,0.000182385,0.00005176852,0.0002061508,0.0003956055,0.0001262664],"domain_scores_gemma":[0.9986619,0.0006541365,0.0001015924,0.0002790152,0.0002435731,0.00005987991],"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.0001668726,0.0002288656,0.0006979987,0.0003779589,0.00005409353,0.0001401398,0.0001634752,0.4184795,0.005530679,0.1072711,0.01576485,0.4511244],"study_design_scores_gemma":[0.00005714223,0.00004588132,0.0001014004,0.00003228736,0.00001174761,0.00009763737,0.00003002418,0.9382858,0.00135055,0.05269206,0.007280102,0.00001537871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002474523,0.0001319372,0.9913819,0.0001913389,0.0000759203,0.0001049634,0.00008803147,0.0008623182,0.004689007],"genre_scores_gemma":[0.03616528,0.0001694062,0.9605789,0.0001082131,0.0000433623,0.0002621743,0.0002652013,0.0002379885,0.002169468],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01645842,"threshold_uncertainty_score":0.0550589,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01944280409074043,"score_gpt":0.2573105092529898,"score_spread":0.2378677051622493,"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."}}