{"id":"W6910453624","doi":"10.4230/lipics.cp.2025.7","title":"Optimizing 2D Cutting: A Bin Packing Approach to Minimize Scraps and Maximize Their Reusability","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Bin packing problem; Reusability; Scrap; Leverage (statistics); Process (computing); Benchmark (surveying); Linear programming; Bin","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.0009670311,0.001242368,0.001434221,0.000954102,0.000442995,0.001623036,0.00116911,0.001539566,0.003653372],"category_scores_gemma":[0.001516027,0.0008560637,0.00107793,0.001818358,0.0007227248,0.00121487,0.001238944,0.001037287,0.0004490011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001189806,"about_ca_system_score_gemma":0.001488954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004150014,"about_ca_topic_score_gemma":0.003892938,"domain_scores_codex":[0.9993269,0.0002112329,0.00002580714,0.0001216745,0.0002271707,0.00008718361],"domain_scores_gemma":[0.9994094,0.0003624287,0.00006359505,0.00005021541,0.00007985954,0.00003452759],"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.00003433826,0.00003018094,0.0001467811,0.00008969384,0.00001717313,0.00003561659,0.00002437205,0.9762322,0.001582687,0.007295891,0.0004504008,0.01406064],"study_design_scores_gemma":[0.000006103522,0.00002845672,0.00007052509,0.000008870228,0.000005450788,0.00002237623,0.00000915798,0.9945358,0.0008661615,0.003589408,0.0008521996,0.000005547651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01501645,0.0003821343,0.9799256,0.0001089841,0.00002886181,0.00005782459,0.0001243151,0.0001809927,0.004174791],"genre_scores_gemma":[0.3941637,0.001058498,0.5959345,0.0001403106,0.0000392503,0.0003881491,0.0004275526,0.000376211,0.007471888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004150014,"threshold_uncertainty_score":0.01222175,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0141834353432223,"score_gpt":0.2301674662517802,"score_spread":0.2159840309085579,"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."}}