{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007786278,0.0009365924,0.0007177824,0.0007399974,0.001003765,0.001519926,0.001038111,0.0009971757,0.004108308],"category_scores_gemma":[0.001598737,0.0003036472,0.0005268611,0.001282503,0.000584047,0.001311188,0.0008800418,0.0008890176,0.0009975847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000619805,"about_ca_system_score_gemma":0.0009168678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003433452,"about_ca_topic_score_gemma":0.002371144,"domain_scores_codex":[0.9990457,0.0002248626,0.00006918905,0.0002199885,0.0002916835,0.0001486134],"domain_scores_gemma":[0.9995962,0.0001934726,0.00005502176,0.00003378335,0.0001001968,0.00002126848],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002566432,0.0001712974,0.001905612,0.0009587481,0.00008068692,0.0006498558,0.0002837383,0.3911967,0.007777689,0.2722641,0.01677041,0.3076846],"study_design_scores_gemma":[0.00005111844,0.0002356861,0.001082624,0.0001333188,0.00004831671,0.0007399517,0.0002590486,0.7399084,0.01014371,0.2117133,0.03560635,0.00007815361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03834212,0.001737749,0.9166921,0.0005482127,0.0004976751,0.0002718525,0.000320635,0.0003921589,0.04119749],"genre_scores_gemma":[0.4781242,0.003720562,0.4744143,0.0004770786,0.0004054431,0.0003992506,0.00109602,0.0001354801,0.04122763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004108308,"threshold_uncertainty_score":0.01374364,"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."}}