{"id":"W3125922185","doi":"10.1142/s0217595921400017","title":"Non-Submodular Maximization with Matroid and Knapsack Constraints","year":2021,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Knapsack problem; Maximization; Mathematics; Constraint (computer-aided design); Greedy algorithm; Combinatorics; Function (biology); Mathematical optimization; Discrete mathematics; Geometry","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.002064294,0.002064854,0.002295562,0.0007537309,0.0004775313,0.001790204,0.002836554,0.001602139,0.005033834],"category_scores_gemma":[0.006923957,0.0007777476,0.00127227,0.002858565,0.00141891,0.003960577,0.001793022,0.002408425,0.001045459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001690275,"about_ca_system_score_gemma":0.001300137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002128021,"about_ca_topic_score_gemma":0.00224977,"domain_scores_codex":[0.9986081,0.0006524185,0.00003837242,0.0003323941,0.0002165381,0.0001522576],"domain_scores_gemma":[0.9964384,0.002552125,0.0003696459,0.0003056802,0.0001634937,0.0001707325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001587298,0.0002278231,0.0004010021,0.0005484727,0.0001340055,0.0002797234,0.00008863597,0.8055757,0.002179611,0.1387493,0.008088115,0.04356889],"study_design_scores_gemma":[0.0000166477,0.00005223901,0.00009947647,0.00001748623,0.00001782726,0.00007867061,0.00002153228,0.9315721,0.0005831235,0.06626979,0.001260518,0.0000105357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0175062,0.0007733362,0.9741346,0.0006130693,0.00008405752,0.00008674457,0.000248118,0.0001921675,0.006361593],"genre_scores_gemma":[0.5296379,0.001889783,0.4545395,0.0004637542,0.0003416054,0.0003927282,0.000660769,0.0003952015,0.0116788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005033834,"threshold_uncertainty_score":0.0168398,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04239402338292181,"score_gpt":0.3160553754276193,"score_spread":0.2736613520446975,"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."}}