{"id":"W2077707231","doi":"10.1016/j.ejor.2005.07.032","title":"Computing the asymptotic worst-case of bin packing lower bounds","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Bin packing problem; Upper and lower bounds; Bin; Mathematics; Asymptotic analysis; Combinatorics; Mathematical optimization; Computer science; Algorithm; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004072573,0.00007940369,0.0001115889,0.0002093773,0.0002448668,0.0002037947,0.0002320979,0.00001584999,0.000171473],"category_scores_gemma":[0.0001814401,0.00005654732,0.00006290789,0.000377572,0.000102828,0.000147142,0.00004646368,0.0004629565,0.00003491835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000466607,"about_ca_system_score_gemma":0.00007090517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000703667,"about_ca_topic_score_gemma":0.000004896004,"domain_scores_codex":[0.9982166,0.0005065533,0.0004945161,0.00007018266,0.0005142684,0.0001978301],"domain_scores_gemma":[0.9987833,0.0003141371,0.00007352438,0.0001221974,0.0006512831,0.00005553418],"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.00001466503,0.00004176498,0.0005689131,0.00002242248,0.00003323003,0.0004743023,0.0003958828,0.9833964,0.001998504,0.003481305,0.007391138,0.002181522],"study_design_scores_gemma":[0.003282755,0.0009568217,0.02257512,0.001048788,0.00004482962,0.007025453,0.0009700791,0.8903613,0.004297168,0.0007938569,0.06796967,0.0006741449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8469993,0.00110885,0.05818454,0.001188624,0.0008117357,0.0002238942,0.00000835037,0.00004373777,0.09143099],"genre_scores_gemma":[0.9964375,0.00002710608,0.002667981,0.00002614666,0.0004467882,2.293124e-7,0.000003107137,0.00002951145,0.0003615709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1494383,"threshold_uncertainty_score":0.2305933,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04496201590172233,"score_gpt":0.3090551839637535,"score_spread":0.2640931680620311,"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."}}