{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003875484,0.000139864,0.000134571,0.0001840964,0.0004409291,0.0002266692,0.0003378403,0.00003259078,0.0001452733],"category_scores_gemma":[0.0008680125,0.00007738049,0.00007768394,0.0001984742,0.0001058955,0.0006674994,0.00003074888,0.0003399175,0.00003832256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000846643,"about_ca_system_score_gemma":0.0001135255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001742429,"about_ca_topic_score_gemma":0.000002801565,"domain_scores_codex":[0.9976256,0.0007258154,0.000492968,0.0001716946,0.0007099312,0.0002739489],"domain_scores_gemma":[0.9963306,0.001739945,0.00007771892,0.0001858827,0.001517238,0.0001486491],"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.0001681993,0.00016342,0.0009296609,0.0000369186,0.0001391467,0.000007531139,0.001311596,0.8791366,0.08653414,0.004390482,0.01483536,0.01234693],"study_design_scores_gemma":[0.003477618,0.0007589275,0.005266807,0.0001538155,0.00001829292,0.00009310085,0.0001855899,0.9293881,0.004933377,0.0001042307,0.05530743,0.0003127118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01689723,0.0003034724,0.9750347,0.001955823,0.0003117185,0.0008237573,0.00005599751,0.00005035201,0.004566964],"genre_scores_gemma":[0.9084443,0.0001074627,0.08964273,0.00008574635,0.0007966363,0.00002460419,0.00003348986,0.00005729029,0.0008077084],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8915471,"threshold_uncertainty_score":0.3391315,"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."}}