{"id":"W4292737938","doi":"10.1287/ijoc.2022.1223","title":"A Branch-and-Price Algorithm for the Multiple Knapsack Problem","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval; Université de Montréal","funders":"","keywords":"Knapsack problem; Lagrangian relaxation; Mathematical optimization; Cutting stock problem; Combinatorial optimization; Mathematics; Change-making problem; Relaxation (psychology); Branch and bound; Continuous knapsack problem; Algorithm; Decomposition; Integer programming; Computer science; Optimization problem","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.001596689,0.002041397,0.002055189,0.001490269,0.001598669,0.002282791,0.002216172,0.002354732,0.01381656],"category_scores_gemma":[0.004063147,0.001120919,0.001362093,0.002958797,0.0009257862,0.002631287,0.002553604,0.004198126,0.004044219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554567,"about_ca_system_score_gemma":0.003424865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005276391,"about_ca_topic_score_gemma":0.006194404,"domain_scores_codex":[0.9986105,0.0003409561,0.00008026126,0.0002710378,0.0004389775,0.000258165],"domain_scores_gemma":[0.9986526,0.0007656393,0.0001205046,0.0001440681,0.0002084199,0.0001087346],"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.0002985721,0.0004642534,0.0005463524,0.0003956141,0.0001170164,0.0002862951,0.000240842,0.4893329,0.003508774,0.06999886,0.02802102,0.4067895],"study_design_scores_gemma":[0.0001187511,0.0001026285,0.0001010586,0.00003445429,0.00002943902,0.0001080806,0.00005182886,0.9544778,0.0008505142,0.03639132,0.007715772,0.00001826917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00428665,0.0004581296,0.9857619,0.0004004556,0.00012268,0.000234328,0.0001177936,0.0008630963,0.007755032],"genre_scores_gemma":[0.05060585,0.0005446072,0.9417399,0.0001798292,0.0001263443,0.000487416,0.0005003536,0.0003690739,0.005446724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01381656,"threshold_uncertainty_score":0.04622102,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01363343159274971,"score_gpt":0.2242847312225913,"score_spread":0.2106512996298416,"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."}}