{"id":"W3093212826","doi":"10.1287/ijoc.2020.0983","title":"The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Knapsack problem; Heuristics; Mathematical optimization; Integer programming; Generalization; Cutting stock problem; Continuous knapsack problem; Pairwise comparison; Quadratic programming; Set (abstract data type); Change-making problem; Mathematics; Constraint (computer-aided design); Constraint programming; Computer science; Optimization problem; Stochastic programming; Artificial intelligence","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.001951128,0.001035051,0.0009663416,0.0005916051,0.001174523,0.002491652,0.001634469,0.001517951,0.006612457],"category_scores_gemma":[0.004488932,0.0005272764,0.001008845,0.002070534,0.001369713,0.00354094,0.002067054,0.002011237,0.0009323584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001721635,"about_ca_system_score_gemma":0.002150988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005075007,"about_ca_topic_score_gemma":0.003354446,"domain_scores_codex":[0.9979565,0.0007308408,0.0001330006,0.0003717804,0.0005273049,0.0002805813],"domain_scores_gemma":[0.9975696,0.001325668,0.0003165236,0.0002957827,0.0003394237,0.0001529536],"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.0003272606,0.0003662203,0.002697916,0.0008399324,0.0001384389,0.0005744008,0.0003386629,0.6200697,0.004785985,0.2285179,0.01083643,0.1305072],"study_design_scores_gemma":[0.00009055289,0.0002591205,0.002008791,0.0001162951,0.00006313211,0.0007954717,0.0003967187,0.7523024,0.005498096,0.2109393,0.02745523,0.00007493164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04347951,0.001235394,0.9318385,0.001054697,0.0001931515,0.0002559655,0.0003948134,0.0001767458,0.02137138],"genre_scores_gemma":[0.5024332,0.002041207,0.473775,0.000434999,0.0003354056,0.0003669207,0.001148049,0.0001607761,0.01930442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006612457,"threshold_uncertainty_score":0.02212083,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01318296666033271,"score_gpt":0.208063192130281,"score_spread":0.1948802254699483,"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."}}