{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001441135,0.00008003943,0.00007186094,0.00001591464,0.0001173975,0.00005161078,0.00002725842,0.00002566762,0.000007160904],"category_scores_gemma":[0.00000151256,0.00005287711,0.000007732724,0.00006110564,0.00004426026,0.00004179353,0.0000100484,0.00005626274,0.00001395104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008728405,"about_ca_system_score_gemma":0.000005562155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.462216e-7,"about_ca_topic_score_gemma":0.00000278425,"domain_scores_codex":[0.9995922,0.000001996664,0.0001212838,0.00005099014,0.00009726338,0.0001362408],"domain_scores_gemma":[0.9997621,0.0000904392,0.00003406227,0.00005169363,0.0000205817,0.00004119163],"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.000007895019,0.00006760464,0.0003261946,0.0003420851,0.00009865304,4.513013e-7,0.00247823,0.6186057,0.0007311698,0.2748021,0.0008520839,0.1016878],"study_design_scores_gemma":[0.0004005611,0.00001674264,0.0003662893,0.00005952889,0.00002262053,0.00002780814,0.0001706241,0.9836958,0.0002381197,0.0143042,0.0005042105,0.000193478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04453172,0.000163774,0.9358588,0.00005219272,0.00008221511,0.0003376662,0.000001558741,0.0001847811,0.01878732],"genre_scores_gemma":[0.8575357,0.000006973175,0.1423653,0.00002124656,0.000023063,0.00001684622,0.000007187679,0.00001522905,0.000008514427],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8130039,"threshold_uncertainty_score":0.2156266,"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."}}