{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001800326,0.0001151037,0.0001141132,0.00002248495,0.0002598534,0.0003110505,0.0001030296,0.00003082032,0.00001033255],"category_scores_gemma":[0.00003345251,0.00006715208,0.00001885839,0.000106693,0.00006975389,0.0001108959,0.00001598406,0.0003581561,0.00001623685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001595126,"about_ca_system_score_gemma":0.00001969994,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.763059e-7,"about_ca_topic_score_gemma":6.770708e-7,"domain_scores_codex":[0.9993211,0.00001022799,0.0002582547,0.00006325604,0.0001485064,0.0001986594],"domain_scores_gemma":[0.9995439,0.0001161387,0.00009135221,0.00005454511,0.0000504475,0.0001435836],"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.00002232782,0.000004244181,0.001678186,0.00007391139,0.00005045468,0.00001562123,0.003449257,0.9374162,0.00005148631,0.001427436,0.0004602315,0.05535068],"study_design_scores_gemma":[0.0009857158,0.0001797851,0.0005232801,0.0002361388,0.000006487863,0.0002510222,0.0002429202,0.9788821,0.0001236568,0.00004581156,0.0183334,0.0001896271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3916474,0.0009345706,0.498035,0.006983545,0.001201518,0.001210417,0.000008958508,0.001162859,0.0988157],"genre_scores_gemma":[0.9927831,0.00007446564,0.006254985,0.0007563729,0.00009675835,6.097879e-7,8.483451e-7,0.00001555574,0.00001735515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6011357,"threshold_uncertainty_score":0.2999467,"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."}}