{"id":"W2015457254","doi":"10.1007/s11227-007-0144-2","title":"A multiprocessor based heuristic for multi-dimensional multiple-choice knapsack problem","year":2007,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Knapsack problem; Computer science; Heuristic; Multiprocessing; Parallel computing; Overhead (engineering); Change-making problem; Mathematical optimization; Algorithm; Continuous knapsack problem; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.001765914,0.0001742467,0.0002289241,0.0001442911,0.0001885253,0.00003700117,0.0002517913,0.00007411065,0.00001566751],"category_scores_gemma":[0.0004808489,0.0001258095,0.0001151359,0.0002065406,0.00003824161,0.0001359721,0.00002156867,0.0003210536,0.00000535208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005879111,"about_ca_system_score_gemma":0.00003930897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009757843,"about_ca_topic_score_gemma":0.00002232053,"domain_scores_codex":[0.9986551,0.00003967544,0.0006384781,0.00008898877,0.000235121,0.0003426307],"domain_scores_gemma":[0.9971699,0.002127553,0.0001419095,0.0001168961,0.0003325796,0.0001112352],"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.00005542033,0.0000556723,0.002649561,0.0001531561,0.00004524494,0.000003482088,0.0007749472,0.9886652,0.004447985,0.000009299385,0.0003730942,0.002766955],"study_design_scores_gemma":[0.00204622,0.00007113505,0.001805694,0.0002325121,0.0000448241,0.00006595229,0.0001317574,0.9916015,0.002664852,0.00001827356,0.001146505,0.0001707436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.236809,0.0004150068,0.7617663,0.0001015507,0.0004447015,0.0002807245,0.000005614899,0.00009872428,0.00007830686],"genre_scores_gemma":[0.8163989,0.000005414893,0.1831199,0.000151352,0.0002540875,0.000001105778,0.000004020972,0.00004253067,0.00002272088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5795898,"threshold_uncertainty_score":0.5130363,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03654757383663416,"score_gpt":0.2712778168740724,"score_spread":0.2347302430374382,"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."}}