{"id":"W2158742617","doi":"10.1016/j.amc.2012.03.052","title":"The three-dimensional knapsack problem with balancing constraints","year":2012,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"ca_institutions":"Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Knapsack problem; Continuous knapsack problem; Heuristics; Packing problems; Mathematical optimization; Mathematics; Cutting stock problem; Heuristic; Change-making problem; Upper and lower bounds; Polynomial-time approximation scheme; Combinatorial optimization; Extension (predicate logic); Computer science; Optimization problem; Algorithm","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.0008272728,0.0009552404,0.001152124,0.0008779144,0.001045312,0.00322752,0.001559072,0.00258801,0.006640062],"category_scores_gemma":[0.003277084,0.0006112916,0.0008584175,0.00242311,0.001184667,0.002629218,0.002078999,0.001768419,0.001056392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006372168,"about_ca_system_score_gemma":0.0009031795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003551125,"about_ca_topic_score_gemma":0.00215073,"domain_scores_codex":[0.9992455,0.0002071966,0.00004552195,0.0001494385,0.0002392919,0.0001130153],"domain_scores_gemma":[0.9989478,0.0005281646,0.0001578709,0.0001264772,0.0001209165,0.0001188091],"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.0002889851,0.0001304536,0.0006777456,0.0004117189,0.00007153728,0.0004166818,0.0001017416,0.77647,0.004065156,0.1343427,0.008317383,0.07470582],"study_design_scores_gemma":[0.00004115955,0.00005195663,0.0005433034,0.00005602303,0.00002064812,0.0002102217,0.0001159184,0.8380911,0.002107582,0.1503219,0.008388174,0.00005201135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04350498,0.001444997,0.9237782,0.001135448,0.000500724,0.00008222052,0.0006978048,0.0002161282,0.02863949],"genre_scores_gemma":[0.6343414,0.002621914,0.3386334,0.0005916645,0.0004121448,0.0003267085,0.001190029,0.0002872345,0.02159547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006640062,"threshold_uncertainty_score":0.02221328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01022187480809189,"score_gpt":0.2026838768217767,"score_spread":0.1924620020136848,"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."}}