{"id":"W3122681984","doi":"10.1287/ijoc.2020.1014","title":"Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Compute Canada; Università Degli Studi di Modena e Reggio Emila","keywords":"Bin packing problem; Set packing; Set (abstract data type); Packing problems; Generalization; Bin; Heuristics; Heuristic; Mathematics; Mathematical optimization; Benchmark (surveying); Bounding overwatch; Decomposition; Benders' decomposition; Algorithm; Container (type theory); Computer science; Preprocessor; Branch and cut; Combinatorial optimization; Integer programming; Artificial intelligence","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.00114529,0.0024159,0.001217378,0.001590625,0.0006584458,0.002098203,0.001768391,0.001655907,0.01379391],"category_scores_gemma":[0.00383666,0.0008116574,0.002167156,0.002848766,0.000899863,0.002781464,0.001858036,0.004938826,0.003687087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503181,"about_ca_system_score_gemma":0.001712678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002155154,"about_ca_topic_score_gemma":0.002178231,"domain_scores_codex":[0.9986748,0.0003722144,0.00007368316,0.0002865894,0.0004457364,0.0001470305],"domain_scores_gemma":[0.9988204,0.000546088,0.0001421246,0.0001950391,0.0002078647,0.00008843437],"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.0002767177,0.0005380775,0.001023701,0.001028209,0.000163371,0.0003081185,0.0002273179,0.4917166,0.006749075,0.2150641,0.04199051,0.2409142],"study_design_scores_gemma":[0.00008044831,0.0001399443,0.0004609853,0.0001848241,0.00006807806,0.0003330279,0.00008588196,0.7848467,0.002527832,0.1789742,0.03224327,0.0000549029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007107111,0.00113219,0.9723173,0.0006615956,0.0002733252,0.0002795456,0.0006573066,0.0007023808,0.01686926],"genre_scores_gemma":[0.1245942,0.002601152,0.8541479,0.0008155836,0.0004832694,0.0008159414,0.003814288,0.0005312177,0.01219641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01379391,"threshold_uncertainty_score":0.04614526,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01548544245106256,"score_gpt":0.2649396540186887,"score_spread":0.2494542115676262,"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."}}