{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004411656,0.0001378647,0.0002159438,0.0001735165,0.000143765,0.0001544879,0.0002140894,0.00009587664,0.00001428651],"category_scores_gemma":[0.0001658577,0.0001071076,0.0001157085,0.0004758523,0.00002856637,0.0001918056,0.00001613778,0.0002011452,0.000001173107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001203189,"about_ca_system_score_gemma":0.00008964942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001061482,"about_ca_topic_score_gemma":5.087784e-7,"domain_scores_codex":[0.999041,0.00003641528,0.0004809869,0.00008245339,0.0001789273,0.0001802602],"domain_scores_gemma":[0.9989486,0.0002486146,0.0002049719,0.0001321575,0.0004204215,0.00004518089],"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.00004617624,0.00003878641,0.00002174319,0.0001110626,0.00009734828,6.27947e-7,0.0001523666,0.9865311,0.00002945793,0.00792816,0.002034098,0.003009088],"study_design_scores_gemma":[0.001670576,0.0001213223,0.0000136713,0.0001618569,0.0001310749,0.000007732474,0.00005697458,0.9702745,0.0001292894,0.00334223,0.02396582,0.0001249389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001394761,0.0008571226,0.9915471,0.0007076613,0.005247565,0.0005625236,0.000002121438,0.00008587522,0.000850571],"genre_scores_gemma":[0.6354145,0.001154606,0.3618108,0.0001026503,0.000494345,0.00008908661,0.00002490644,0.00009975163,0.0008093299],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6352751,"threshold_uncertainty_score":0.4367722,"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."}}