{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036655,0.001892378,0.001470182,0.002601529,0.001059562,0.004028234,0.001472488,0.001545056,0.009269099],"category_scores_gemma":[0.02067276,0.001122596,0.001754169,0.002728568,0.001498666,0.003971117,0.002658492,0.004133163,0.001611091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002478461,"about_ca_system_score_gemma":0.003700779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004106933,"about_ca_topic_score_gemma":0.005778543,"domain_scores_codex":[0.995336,0.001471494,0.0002351364,0.0006160412,0.001855255,0.0004860412],"domain_scores_gemma":[0.9891261,0.008429592,0.0006059807,0.0006714187,0.0008837811,0.0002832641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001952422,0.0002012417,0.0009384879,0.0006458868,0.00006358935,0.00009218427,0.0001376771,0.6984978,0.002787979,0.1626658,0.006263652,0.1275106],"study_design_scores_gemma":[0.00002884379,0.00005400295,0.0001562263,0.0001182278,0.00002145253,0.00004209317,0.00003234905,0.8973825,0.001543171,0.09564391,0.00495744,0.00001977339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01274867,0.001821342,0.9728919,0.0004939819,0.0001604881,0.0001069056,0.0003138198,0.0006067505,0.01085602],"genre_scores_gemma":[0.3455738,0.002817723,0.6436001,0.0004798895,0.0002200855,0.0004461002,0.001210798,0.0005990947,0.005052417],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009269099,"threshold_uncertainty_score":0.03100818,"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."}}