{"id":"W1991548888","doi":"10.1287/opre.2014.1307","title":"An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Université Laval","funders":"","keywords":"Bin packing problem; Packing problems; Mathematical optimization; Algorithm; Set packing; Benchmark (surveying); Branch and cut; Benders' decomposition; Preprocessor; Integer programming; Cutting stock problem; Relaxation (psychology); Heuristics; Computer science; Mathematics; Exact solutions in general relativity; Integer (computer science); Optimization problem; Bin","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.001320642,0.0001095608,0.00009502714,0.000128784,0.0008278057,0.0003452814,0.000182504,0.00004622171,0.0002708994],"category_scores_gemma":[0.00004321277,0.00007512651,0.00002462094,0.0003347528,0.0001722728,0.0002278488,0.00001988454,0.0002893749,0.00003188619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004347791,"about_ca_system_score_gemma":0.00009795764,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000237172,"about_ca_topic_score_gemma":0.0001650799,"domain_scores_codex":[0.9988074,0.0001219934,0.0001605086,0.0001972405,0.0003594815,0.0003534033],"domain_scores_gemma":[0.9989106,0.0003429814,0.00000748202,0.0002477433,0.0003889998,0.0001021796],"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.00000345641,0.00001977172,0.00006761,0.0000113065,0.00002350031,5.16984e-7,0.0002116063,0.9292879,0.001224676,0.005936018,0.0002633856,0.06295033],"study_design_scores_gemma":[0.0004679086,0.00009863632,0.0000716455,0.00003066808,0.000005863767,0.00001340708,0.00008834985,0.9960629,0.0007162737,0.00009532561,0.0022308,0.0001181859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008509349,0.00005121941,0.9842901,0.0004455524,0.0001122341,0.0009312357,0.00004212221,0.0001775791,0.005440576],"genre_scores_gemma":[0.859951,0.000006116979,0.1391225,0.00004870072,0.000170534,0.0002271889,0.00009868562,0.00003993009,0.0003354025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8514416,"threshold_uncertainty_score":0.6366896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0416455721630172,"score_gpt":0.3361884072885659,"score_spread":0.2945428351255487,"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."}}