{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008670966,0.000101501,0.0001909282,0.00009731765,0.0001744409,0.00004576814,0.0002217096,0.00005162349,0.0002581668],"category_scores_gemma":[0.00008197782,0.00006865686,0.00004385537,0.0003232544,0.0001662668,0.000098043,0.00003958546,0.0001643465,0.00002180551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002283961,"about_ca_system_score_gemma":0.0001129776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004557038,"about_ca_topic_score_gemma":0.00001770699,"domain_scores_codex":[0.9989749,0.00003914608,0.0003539321,0.0001021777,0.0003017487,0.0002280619],"domain_scores_gemma":[0.9987754,0.0003689969,0.00003243394,0.0002844772,0.0004988124,0.00003984094],"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.000205424,0.002921792,0.0005469689,0.006465664,0.002470623,0.000008993279,0.1515901,0.6534234,0.03270226,0.0517648,0.03049249,0.0674075],"study_design_scores_gemma":[0.0004476892,0.0001118936,0.000003122788,0.0001641704,0.00002221644,0.00001339259,0.000720074,0.9869955,0.01095708,0.0001316358,0.0003291216,0.0001040591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02078968,0.0001839937,0.8785082,0.0001595569,0.00008038052,0.004675793,0.0002488719,0.0001812326,0.09517231],"genre_scores_gemma":[0.2152938,0.00003744012,0.7828625,0.000004909125,0.00002967537,0.000315785,0.00001147476,0.00005497755,0.001389461],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3335721,"threshold_uncertainty_score":0.2826746,"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."}}