{"id":"W4412453266","doi":"10.1016/j.cor.2025.107197","title":"Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Université Laval; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Knapsack problem; Mathematics; Binary number; Continuous knapsack problem; Quadratic equation; Mathematical optimization; Upper and lower bounds; Combinatorics; Binary decision diagram; Cutting stock problem; Change-making problem; Combinatorial optimization; Computer science; Optimization problem; Algorithm; Arithmetic","routes":{"ca_aff":true,"ca_fund":true,"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.0005079041,0.0001192484,0.00012175,0.0001590793,0.0008178735,0.000633391,0.0002604564,0.00007630842,0.00004649568],"category_scores_gemma":[0.00006085222,0.00008693644,0.0000431789,0.0006291238,0.0001331159,0.0002317386,0.000152802,0.0002510119,0.00002702298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000616611,"about_ca_system_score_gemma":0.00007703467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000217532,"about_ca_topic_score_gemma":0.00007948682,"domain_scores_codex":[0.9989895,0.00007066184,0.0002204547,0.0002219862,0.0002063738,0.0002909725],"domain_scores_gemma":[0.9986368,0.000748563,0.000005298133,0.0003277992,0.0002345383,0.00004696377],"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.00001544846,0.00005344058,0.00009213635,0.00009452878,0.00006457161,0.000001161204,0.001090312,0.8725156,0.0001888368,0.02005169,0.07597438,0.02985794],"study_design_scores_gemma":[0.0003757612,0.00007248216,0.0002034259,0.0001205001,0.000008123943,0.000001797997,0.00007062647,0.9215059,0.0001068868,0.001699236,0.07573053,0.000104695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006646861,0.001836584,0.9833348,0.003172411,0.0007026128,0.001239445,0.000008073092,0.000134842,0.002924316],"genre_scores_gemma":[0.8236482,0.001793563,0.1680514,0.0004973244,0.0001937872,0.0006907273,0.00007921049,0.00006223371,0.004983561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8170013,"threshold_uncertainty_score":0.6290504,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03809884161290548,"score_gpt":0.3512012290622354,"score_spread":0.3131023874493299,"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."}}