{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004823836,0.0001420476,0.000128853,0.00008501181,0.0003579435,0.0003410703,0.0001437255,0.00006029195,0.00001245283],"category_scores_gemma":[0.00002580833,0.00008236067,0.0000404539,0.0001423642,0.00003239046,0.0001591787,0.00002041619,0.0006076411,0.000005293933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001662858,"about_ca_system_score_gemma":0.0000220202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002112796,"about_ca_topic_score_gemma":0.000003475503,"domain_scores_codex":[0.9992295,0.000004939141,0.0002617619,0.00007610524,0.0001598299,0.000267873],"domain_scores_gemma":[0.999337,0.0002547417,0.0001138158,0.0001028005,0.00009748437,0.00009422675],"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.0000106607,0.000008357406,0.0003650395,0.00004997204,0.00006861686,0.000002965196,0.001691881,0.4017515,0.0001860121,0.001302115,0.0002321513,0.5943308],"study_design_scores_gemma":[0.0009396694,0.000110761,0.0005018059,0.000153717,0.00001365413,0.0004152835,0.00005474735,0.9385872,0.000341705,0.0001590753,0.05852293,0.0001994429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03277739,0.00008670631,0.9601796,0.0003089892,0.0008319357,0.0003544044,0.000002815363,0.0001988374,0.005259342],"genre_scores_gemma":[0.9046798,0.00005216349,0.09407566,0.000532773,0.0005141559,0.000005883625,0.000002343692,0.00004738316,0.00008979822],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8719025,"threshold_uncertainty_score":0.3358571,"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."}}