{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000848569,0.0008752659,0.001607864,0.001410003,0.001117978,0.001298446,0.001981671,0.001459584,0.004253177],"category_scores_gemma":[0.00225013,0.0007534893,0.0007709093,0.001631164,0.0005028357,0.001233336,0.001176612,0.0009042564,0.0004693063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009341393,"about_ca_system_score_gemma":0.001754154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004852273,"about_ca_topic_score_gemma":0.007839649,"domain_scores_codex":[0.9994454,0.0001735379,0.00003267204,0.00009029709,0.0001292004,0.0001289297],"domain_scores_gemma":[0.9988223,0.0005880366,0.0001068879,0.0001075058,0.0002622009,0.0001130086],"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.0003778272,0.0002035785,0.0005639985,0.0001108224,0.00005976771,0.0001206874,0.00003597193,0.9148933,0.003259321,0.003031259,0.002061062,0.07528233],"study_design_scores_gemma":[0.00004758315,0.00007729934,0.0001359645,0.000006267104,0.00001916501,0.00002455288,0.00001356488,0.9976585,0.0004985426,0.00108471,0.0004248197,0.000009038773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1134897,0.001664967,0.8721898,0.0004717055,0.0006493355,0.0002381294,0.0001464351,0.001075089,0.01007483],"genre_scores_gemma":[0.558534,0.0003892487,0.437054,0.0002148774,0.0001056609,0.0002446339,0.0002278808,0.0001450482,0.0030846],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004852273,"threshold_uncertainty_score":0.01422828,"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."}}