{"id":"W4298867261","doi":"","title":"Upper bounds and algorithms for the maximum cardinality bin packing problem","year":2003,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bin packing problem; Cardinality (data modeling); Bin; Computer science; Algorithm; Combinatorics; Upper and lower bounds; Mathematics; Mathematical optimization; Database","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.007391085,0.004017343,0.003759756,0.004751703,0.002838844,0.01316968,0.007805852,0.00494273,0.01600759],"category_scores_gemma":[0.04520529,0.002574151,0.003260289,0.01069626,0.003528188,0.01795972,0.008557416,0.01266211,0.004490539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006636729,"about_ca_system_score_gemma":0.003579927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003738795,"about_ca_topic_score_gemma":0.00422281,"domain_scores_codex":[0.9910488,0.002295824,0.0004285278,0.0009542486,0.003637019,0.001635599],"domain_scores_gemma":[0.9670842,0.02575139,0.001446296,0.003059538,0.001760136,0.000898436],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001436886,0.0007585668,0.0009436776,0.00114693,0.0001735221,0.0001248059,0.0004518349,0.3107617,0.003171981,0.3717746,0.03607388,0.2731817],"study_design_scores_gemma":[0.0001701777,0.0000914788,0.0003603281,0.0002620812,0.000094862,0.0001274926,0.0001208552,0.5746598,0.002240708,0.4087416,0.01307119,0.0000592794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01714354,0.01245271,0.9208406,0.003929087,0.0007699279,0.0002413434,0.0008987267,0.001700726,0.04202349],"genre_scores_gemma":[0.2006303,0.01366418,0.7558324,0.001633499,0.002599246,0.001292833,0.003350226,0.001872421,0.01912486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01600759,"threshold_uncertainty_score":0.05355066,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01503853518162119,"score_gpt":0.2180373778613141,"score_spread":0.202998842679693,"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."}}