{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008693463,0.001613757,0.001633836,0.001329756,0.001098567,0.001943482,0.002289491,0.001931552,0.0158427],"category_scores_gemma":[0.003620997,0.0008431576,0.00121361,0.00249774,0.0007177971,0.002710652,0.002125035,0.002176091,0.004105035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001416724,"about_ca_system_score_gemma":0.003009665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005255193,"about_ca_topic_score_gemma":0.006629647,"domain_scores_codex":[0.998867,0.0001701984,0.00006336808,0.0002444988,0.0004557456,0.0001993034],"domain_scores_gemma":[0.9988629,0.0005417616,0.00009895641,0.0002426298,0.0002028762,0.00005093465],"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.0001503337,0.0002928327,0.0004421981,0.0004313394,0.00005649185,0.0001693711,0.0001649161,0.4006996,0.003730239,0.04997978,0.01512726,0.5287556],"study_design_scores_gemma":[0.00009701132,0.00007266803,0.0001605619,0.00003852453,0.00001873459,0.0001718135,0.00005928583,0.952698,0.001265532,0.03561534,0.009780212,0.00002220369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002782305,0.0002394762,0.9900568,0.0001128804,0.00006766967,0.0001133254,0.0001249526,0.000980805,0.005521726],"genre_scores_gemma":[0.03285536,0.0002808085,0.9631874,0.00007668893,0.00004275128,0.0002470804,0.0004376898,0.000238851,0.00263329],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0158427,"threshold_uncertainty_score":0.05299914,"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."}}