{"id":"W2124475618","doi":"10.1287/ijoc.1100.0406","title":"A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bin packing problem; Mathematical optimization; Set packing; Bin; Branch and bound; Mathematics; Heuristics; Branch and cut; Algorithm; Branching (polymer chemistry); Set (abstract data type); Scheduling (production processes); Computer science; Integer programming","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.001151818,0.001206709,0.001539969,0.001177743,0.001155551,0.001575825,0.002229724,0.001847577,0.01146652],"category_scores_gemma":[0.004271437,0.0008438058,0.001030511,0.002626706,0.0007754767,0.00241947,0.00266595,0.003029564,0.002000377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001088032,"about_ca_system_score_gemma":0.002409001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003019581,"about_ca_topic_score_gemma":0.003522233,"domain_scores_codex":[0.9989367,0.0002434147,0.00006986788,0.000149158,0.0004481774,0.000152619],"domain_scores_gemma":[0.999019,0.0005505595,0.00007091121,0.00009746479,0.0001909695,0.00007110162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000185434,0.0003251045,0.0005921123,0.0003141717,0.00008810638,0.0002499817,0.000211633,0.4041062,0.005237954,0.07208867,0.01399825,0.5026025],"study_design_scores_gemma":[0.000113443,0.00008609007,0.0001244925,0.00002253706,0.00002672277,0.0001519187,0.00003673074,0.9526123,0.001531577,0.03819547,0.007075271,0.0000234725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003181403,0.0001892938,0.9934086,0.0001825501,0.00005079924,0.0001487133,0.00005161969,0.0003475868,0.002439471],"genre_scores_gemma":[0.03090531,0.000223481,0.9662881,0.00007336927,0.00004317515,0.0003022304,0.0001923057,0.0001539366,0.00181812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01146652,"threshold_uncertainty_score":0.0383594,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0101253620362066,"score_gpt":0.2244824884865048,"score_spread":0.2143571264502983,"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."}}