{"id":"W3175250543","doi":"10.1016/j.dam.2023.02.003","title":"A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec à Montréal","keywords":"Knapsack problem; Mathematics; Mathematical optimization; Change-making problem; Continuous knapsack problem; Quadratic programming; Heuristic; Algorithm; Cutting stock problem; Dynamic programming; Binary number; Constraint (computer-aided design); Function (biology); Integer programming; Optimization problem","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.0005048662,0.0008265076,0.00131353,0.0007995436,0.0006796968,0.0010433,0.00154432,0.001174162,0.01044876],"category_scores_gemma":[0.002413236,0.0005397044,0.0009209904,0.001218147,0.0006308561,0.001326257,0.002800446,0.002736377,0.002169749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006690172,"about_ca_system_score_gemma":0.00174177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003864939,"about_ca_topic_score_gemma":0.003625816,"domain_scores_codex":[0.9994724,0.00007807346,0.00002298889,0.00009282954,0.000245811,0.00008794173],"domain_scores_gemma":[0.999478,0.0001894962,0.00003008197,0.00008908822,0.0001449417,0.0000684751],"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.0002524134,0.0002769682,0.0003329314,0.0001734848,0.00004086387,0.0001193529,0.000097544,0.5286037,0.004914958,0.04663586,0.009398651,0.4091533],"study_design_scores_gemma":[0.00004056293,0.00004861664,0.00005744009,0.00001402558,0.000006071707,0.0000337277,0.00001253103,0.9838935,0.000627485,0.01238764,0.002869342,0.000009136024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007177374,0.000142327,0.9876348,0.0001528063,0.0001628642,0.0000716965,0.00007968462,0.00061622,0.003962131],"genre_scores_gemma":[0.1270383,0.000246072,0.8648617,0.000169289,0.0001140592,0.0002934228,0.000427404,0.0002877584,0.006561958],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01044876,"threshold_uncertainty_score":0.03495455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0124201419681223,"score_gpt":0.2436527707356479,"score_spread":0.2312326287675256,"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."}}