{"id":"W2374538697","doi":"","title":"0/1 Knapsack Problem","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Knapsack problem; Backtracking; Continuous knapsack problem; Computer science; Mathematical optimization; Cutting stock problem; Greedy algorithm; Change-making problem; Polynomial-time approximation scheme; Branch and bound; Realization (probability); Optimization problem; Algorithm; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009345249,0.00008877216,0.00006696245,0.00007460599,0.0000625641,0.00003750311,0.0001341783,0.00004940466,0.00005412479],"category_scores_gemma":[4.913194e-8,0.00009615309,0.00002980169,0.0002547066,0.00001596949,0.00004990369,0.00001925321,0.0000842346,0.0004319287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002714853,"about_ca_system_score_gemma":0.000005096372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001491243,"about_ca_topic_score_gemma":0.000004726686,"domain_scores_codex":[0.9994703,0.000002797134,0.0001715846,0.0001204178,0.00005066936,0.00018425],"domain_scores_gemma":[0.9997206,0.00001945109,0.00001552312,0.0001470731,0.00003356865,0.00006380625],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000002531389,0.0001167411,0.0007090467,0.0001610742,0.00006867523,0.000001893482,0.0008920512,0.1266675,0.02196573,0.01972895,0.05325234,0.7764335],"study_design_scores_gemma":[0.0001190626,0.000003725887,0.0003446898,0.000006006271,0.000003826603,0.000008401995,0.000005618081,0.005088584,0.004138064,0.0005086004,0.9896384,0.0001350065],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004065294,0.0001105331,0.9625713,0.00005975672,0.00001963441,0.0003387398,0.000003636471,0.00063207,0.03585783],"genre_scores_gemma":[0.07835665,0.00003362188,0.920068,0.0003094869,0.0002467676,0.0001325936,0.00006168061,0.00004829008,0.0007428822],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.936386,"threshold_uncertainty_score":0.5551714,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004686204796815385,"score_gpt":0.2035872261520742,"score_spread":0.1989010213552588,"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."}}