{"id":"W4360610866","doi":"10.1142/s0217595923400122","title":"Minimization Problems with Non-Submodular Cover Constraint","year":2023,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Cover (algebra); Constraint (computer-aided design); Set function; Set cover problem; Mathematics; Greedy algorithm; Set (abstract data type); Mathematical optimization; Covering problems; Function (biology); Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001406031,0.001560192,0.001977701,0.0007401539,0.0005578833,0.001889342,0.001632773,0.001868061,0.004826684],"category_scores_gemma":[0.004798183,0.0004976485,0.001373302,0.001856432,0.0008643607,0.003073167,0.001594459,0.002165109,0.0006657483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00132185,"about_ca_system_score_gemma":0.00106243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001257361,"about_ca_topic_score_gemma":0.001250234,"domain_scores_codex":[0.9986827,0.0004518585,0.00005303699,0.0003090033,0.0003155598,0.0001878188],"domain_scores_gemma":[0.9977425,0.001704524,0.0001803264,0.0001390342,0.0001325969,0.0001010216],"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.0002243816,0.0003638507,0.001165151,0.00095096,0.0002270386,0.0005316537,0.0001808127,0.5820988,0.003755439,0.2625682,0.01933127,0.1286025],"study_design_scores_gemma":[0.00005107689,0.0001083913,0.0004797473,0.00006763292,0.00004794963,0.0003630356,0.00008952569,0.7987909,0.001430007,0.1915686,0.006980442,0.00002267842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0446072,0.003567603,0.9311212,0.002235793,0.0002682229,0.0001806098,0.0006277295,0.0002769077,0.01711485],"genre_scores_gemma":[0.5931073,0.00483819,0.382641,0.0008508421,0.0008034516,0.0005801544,0.001461932,0.0003430306,0.01537395],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004826684,"threshold_uncertainty_score":0.0161469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06893791714868018,"score_gpt":0.3320586450331574,"score_spread":0.2631207278844772,"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."}}