{"id":"W4402816864","doi":"10.2139/ssrn.4957990","title":"Tight Upper and Lower Bounds for the Quadratic Knapsack Problem Through Binary Decision Diagrams","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Knapsack problem; Binary number; Quadratic equation; Mathematics; Binary decision diagram; Combinatorics; Upper and lower bounds; Mathematical optimization; Algorithm; Arithmetic; Mathematical analysis; Geometry","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005991449,0.002962157,0.003148145,0.003634222,0.001788267,0.009792708,0.004050433,0.003353163,0.01709495],"category_scores_gemma":[0.04243671,0.002046385,0.002242588,0.005969497,0.003169465,0.01123844,0.006362467,0.01045998,0.003583953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004889691,"about_ca_system_score_gemma":0.002968524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003510246,"about_ca_topic_score_gemma":0.00417704,"domain_scores_codex":[0.9902222,0.002790619,0.0003487144,0.001205739,0.003521921,0.001910756],"domain_scores_gemma":[0.9614291,0.03199057,0.001323194,0.002296054,0.00174955,0.001211641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004652113,0.0004393985,0.0006338493,0.0006663114,0.0000911929,0.0001053226,0.0002720586,0.3863261,0.002484327,0.5148417,0.01421729,0.07945736],"study_design_scores_gemma":[0.00004173737,0.00006654148,0.0002320281,0.0001597147,0.00003749243,0.0000534711,0.00004896346,0.4522183,0.001283225,0.5404969,0.005324418,0.00003718675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02646703,0.004711103,0.9164917,0.002187856,0.0005228128,0.0001816364,0.0007467046,0.0006648306,0.04802631],"genre_scores_gemma":[0.6175258,0.008048207,0.338795,0.001501201,0.001282195,0.0008517836,0.002190355,0.001121118,0.02868427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01709495,"threshold_uncertainty_score":0.05718827,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009506888782251517,"score_gpt":0.2455014864579759,"score_spread":0.2359945976757244,"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."}}