{"id":"W4409889535","doi":"10.1007/s10878-025-01294-3","title":"A 3-space dynamic programming heuristic for the cubic knapsack problem","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval; Group for Research in Decision Analysis; Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Theory of computation; Heuristic; Continuous knapsack problem; Dynamic programming; Change-making problem; Mathematical optimization; Mathematics; Space (punctuation); Cubic graph; Combinatorics; Cutting stock problem; Computer science; Discrete mathematics; Algorithm; Optimization problem; Graph","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.0003985114,0.0009932758,0.001280641,0.001164415,0.00100915,0.001218028,0.001689468,0.001773086,0.01171481],"category_scores_gemma":[0.001359786,0.0007254791,0.001126388,0.001684369,0.0005226785,0.00108179,0.001268309,0.001494102,0.001231806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001501329,"about_ca_system_score_gemma":0.003008366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01557049,"about_ca_topic_score_gemma":0.01951325,"domain_scores_codex":[0.9995932,0.00008165009,0.0000139628,0.00005770202,0.0001005185,0.0001528948],"domain_scores_gemma":[0.9995011,0.0002427661,0.00003673194,0.00005297305,0.00009575152,0.000070647],"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.00026395,0.0003178577,0.0002528336,0.0001088212,0.00003238243,0.0001148567,0.00006255249,0.8491132,0.002633611,0.0110746,0.007207487,0.1288178],"study_design_scores_gemma":[0.00004916107,0.00005773182,0.00007393463,0.00001083383,0.00001110851,0.00002719223,0.00002482302,0.9941273,0.0004713896,0.003350685,0.001783195,0.00001272953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08731505,0.0009558647,0.8732251,0.0006863133,0.0004825081,0.0004352397,0.0004306875,0.002106424,0.03436282],"genre_scores_gemma":[0.3556104,0.0003886356,0.6345257,0.0003175267,0.00009208734,0.0003973311,0.0005410854,0.0004237581,0.007703558],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01557049,"threshold_uncertainty_score":0.03918993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005512764533784442,"score_gpt":0.2378373699384901,"score_spread":0.2323246054047056,"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."}}