{"id":"W4398138850","doi":"10.3390/a17050219","title":"The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Bipartite graph; Multipartite; Mathematics; Combinatorics; Integer programming; Discrete mathematics; Mathematical optimization; Computer science; Graph","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.0028237,0.001679422,0.001644652,0.001562895,0.001102143,0.003188328,0.002365333,0.001893061,0.0073541],"category_scores_gemma":[0.01293533,0.001028138,0.001306113,0.005674447,0.001591683,0.006969799,0.00266422,0.004407792,0.0009726297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001489534,"about_ca_system_score_gemma":0.001672906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005585707,"about_ca_topic_score_gemma":0.004292867,"domain_scores_codex":[0.9970504,0.001021668,0.0001476547,0.0005668884,0.0007662024,0.0004472029],"domain_scores_gemma":[0.9933924,0.004174684,0.0007562633,0.0008035147,0.0005853044,0.0002877237],"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.0001385456,0.0002861335,0.0009577838,0.0005781378,0.00006803847,0.0002096902,0.0001656606,0.6655675,0.001434501,0.2494009,0.008642988,0.07255011],"study_design_scores_gemma":[0.00002054169,0.00005688969,0.0003490407,0.00006499441,0.00001542741,0.0001850874,0.0001381438,0.8089582,0.0007194806,0.1837368,0.005726994,0.00002840522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03129766,0.001906012,0.9435245,0.001110859,0.0001827181,0.0001828906,0.0006227165,0.0003075209,0.0208653],"genre_scores_gemma":[0.496307,0.004851703,0.4830866,0.0009243473,0.0006060549,0.0005600742,0.001844747,0.0003785628,0.01144095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0073541,"threshold_uncertainty_score":0.02460194,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01311561027935585,"score_gpt":0.2225104173048545,"score_spread":0.2093948070254986,"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."}}