{"id":"W2559457754","doi":"10.1016/j.ejor.2016.11.042","title":"An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Knapsack problem; Enumeration; Benchmark (surveying); Heuristics; Mathematical optimization; Mathematics; Constraint (computer-aided design); Limit (mathematics); Combinatorial optimization; Convergence (economics); Computer science; Algorithm; Combinatorics","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.00155888,0.001319034,0.001700934,0.001448324,0.0009727724,0.001668458,0.002720308,0.002020576,0.008937135],"category_scores_gemma":[0.006851013,0.0008138942,0.001471582,0.001988775,0.0009436026,0.002342705,0.003133571,0.002403849,0.001616877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007906443,"about_ca_system_score_gemma":0.002373046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003168736,"about_ca_topic_score_gemma":0.004688342,"domain_scores_codex":[0.9984433,0.0005931994,0.00005209947,0.0001437245,0.0005606522,0.0002070016],"domain_scores_gemma":[0.9972573,0.00183449,0.0001094567,0.0002379326,0.0004427778,0.0001179788],"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.0002188394,0.0002673183,0.0005546861,0.000347372,0.00005672666,0.0001756358,0.0002108779,0.7224216,0.00291867,0.08830258,0.006606135,0.1779195],"study_design_scores_gemma":[0.00001704981,0.00003405131,0.0000541219,0.00001829511,0.000007023033,0.00003737776,0.0000241929,0.9798997,0.0004112284,0.01830466,0.001183685,0.0000085723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004968254,0.0001409998,0.9878001,0.0001471095,0.00006230891,0.00009345605,0.00005771872,0.0002599299,0.006470099],"genre_scores_gemma":[0.1277491,0.0002446748,0.8657421,0.0002145273,0.00007393328,0.0005486366,0.0002501634,0.0002400542,0.004936856],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008937135,"threshold_uncertainty_score":0.02989775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1006192863563736,"score_gpt":0.340530058788879,"score_spread":0.2399107724325054,"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."}}