{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005560972,0.0001059199,0.0001072616,0.0000791612,0.0007818107,0.0001609574,0.0001728142,0.00002256734,0.00004250157],"category_scores_gemma":[0.00002489831,0.00007531745,0.00006376677,0.000160316,0.00001264395,0.0000947074,0.00006528643,0.0004453474,0.00000475824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006440005,"about_ca_system_score_gemma":0.000019089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000186329,"about_ca_topic_score_gemma":4.754221e-7,"domain_scores_codex":[0.9992304,0.00001205777,0.0002788517,0.000066942,0.0001817182,0.0002300625],"domain_scores_gemma":[0.9994079,0.0003162511,0.00009289326,0.00008174148,0.00004086892,0.00006033133],"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.000004039644,0.000005445495,0.00008397119,0.00001237953,0.00002879914,8.903069e-7,0.0006506743,0.7341999,0.000008074021,0.0001460838,0.0009907403,0.263869],"study_design_scores_gemma":[0.0006023881,0.00007563988,0.0001238593,0.00002134697,0.000005639659,0.0001651498,0.0001127491,0.879802,0.00002659845,0.0001641146,0.118795,0.000105417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005593394,0.0003742634,0.9890441,0.000348952,0.001134898,0.000386231,0.00001122665,0.0001883151,0.00291859],"genre_scores_gemma":[0.9454662,0.00009130318,0.05271959,0.0009786714,0.0004183906,0.00002327986,0.000007301979,0.00004997103,0.0002452667],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9398729,"threshold_uncertainty_score":0.6013135,"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."}}