{"id":"W1982112521","doi":"10.1287/moor.1110.0515","title":"A Polynomial Time <i>OPT</i> + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Bin packing problem; Bin; Constant (computer programming); Time complexity; Combinatorics; Cutting stock problem; Object (grammar); Integer (computer science); Mathematical optimization; Algorithm; Discrete mathematics; Optimization problem; Computer science; Artificial intelligence","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.001766411,0.002215466,0.001793825,0.00112538,0.001505786,0.00343009,0.004399054,0.003233837,0.01573707],"category_scores_gemma":[0.00443657,0.001165117,0.001809568,0.002845401,0.001305967,0.005480777,0.002176292,0.003459499,0.00562848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004460735,"about_ca_system_score_gemma":0.005678582,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005962049,"about_ca_topic_score_gemma":0.00787857,"domain_scores_codex":[0.9978211,0.0003220219,0.0001478982,0.0007393116,0.0004849386,0.0004847874],"domain_scores_gemma":[0.9980135,0.001009587,0.0002617116,0.0004186066,0.0001651205,0.0001313742],"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.001422814,0.001204472,0.001537477,0.001251722,0.0001683414,0.0002283316,0.0003693711,0.1483972,0.02352164,0.05210627,0.06312743,0.7066649],"study_design_scores_gemma":[0.001837931,0.0008075308,0.001808982,0.0001649739,0.0002207222,0.001046455,0.0002887202,0.8026857,0.01860606,0.1414159,0.03097058,0.0001465348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03861296,0.0009258963,0.9137922,0.002473542,0.000300314,0.0008888613,0.001199338,0.009262518,0.03254441],"genre_scores_gemma":[0.1046917,0.0003149125,0.8829533,0.0005816348,0.0001311912,0.0005543914,0.001529777,0.0009446237,0.008298407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01573707,"threshold_uncertainty_score":0.0526458,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06488040621657191,"score_gpt":0.320694766679413,"score_spread":0.2558143604628411,"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."}}