{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004750058,0.0001431554,0.0001428153,0.00008158478,0.000532133,0.0003161826,0.0001266774,0.00005702423,0.00003413059],"category_scores_gemma":[0.00004119159,0.0001052086,0.0001207118,0.000191612,0.00001676701,0.0001631475,0.00003240033,0.000395194,0.0000120379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001002052,"about_ca_system_score_gemma":0.00006237593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001110924,"about_ca_topic_score_gemma":0.000001413581,"domain_scores_codex":[0.998964,0.00001940953,0.0003964046,0.0000920897,0.0002493873,0.0002787531],"domain_scores_gemma":[0.9991523,0.0003605802,0.0001164716,0.0001046746,0.0001851619,0.00008079458],"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.00001378457,0.0000143391,0.00007475279,0.00002173699,0.00006661598,0.000006140569,0.0002633741,0.9738284,0.0002643103,0.006843178,0.0009725385,0.01763082],"study_design_scores_gemma":[0.001893944,0.00007646441,0.00009714138,0.000246864,0.00002234624,0.0003052307,0.00009909748,0.9827331,0.002368617,0.003861852,0.008069886,0.0002254969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1545965,0.0007937208,0.8007084,0.002411668,0.02046491,0.0009905453,0.00001727883,0.0007919942,0.019225],"genre_scores_gemma":[0.985348,0.00001563197,0.01342942,0.0004645851,0.0006672536,0.000002940678,0.00002016465,0.00003105479,0.00002094986],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8307515,"threshold_uncertainty_score":0.4290283,"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."}}