{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001387705,0.00008527617,0.0001541786,0.0002305168,0.0003055945,0.0004777093,0.0003562104,0.00004182069,0.0001186573],"category_scores_gemma":[0.0001363923,0.00006842367,0.00004030751,0.0006415782,0.0003010266,0.0006596133,0.0001338285,0.0004202544,0.00001140795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004160872,"about_ca_system_score_gemma":0.0007606795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001871482,"about_ca_topic_score_gemma":0.000002767951,"domain_scores_codex":[0.9979958,0.0001827215,0.0002786565,0.0002139734,0.001093766,0.0002351119],"domain_scores_gemma":[0.9975994,0.0001757963,0.00007058072,0.000222013,0.001780187,0.0001519803],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001316053,0.0005474191,0.009272853,0.00007521872,0.0002837843,0.002096153,0.002440603,0.001760477,0.01515349,0.8837506,0.006387146,0.0781007],"study_design_scores_gemma":[0.01454811,0.006269704,0.1963463,0.001769642,0.0000831807,0.0600682,0.01678386,0.2766658,0.07730292,0.2897734,0.05798408,0.002404905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09269167,0.0009986827,0.8763045,0.01294703,0.0003185678,0.0002624198,0.00001051333,0.00001758075,0.01644905],"genre_scores_gemma":[0.9134359,0.0001620201,0.0858813,0.00004018661,0.0001122951,0.000002769891,0.000004740232,0.000006179459,0.0003545804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8207443,"threshold_uncertainty_score":0.4606561,"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."}}