{"id":"https://openalex.org/W4398138850","doi":"https://doi.org/10.3390/a17050219","title":"The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions","display_name":"The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions","publication_year":2024,"publication_date":"2024-05-18","ids":{"openalex":"https://openalex.org/W4398138850","doi":"https://doi.org/10.3390/a17050219"},"language":"en","primary_location":{"id":"doi:10.3390/a17050219","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17050219","pdf_url":"https://www.mdpi.com/1999-4893/17/5/219/pdf?version=1716018322","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/17/5/219/pdf?version=1716018322","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079361771","display_name":"Abraham P. Punnen","orcid":"https://orcid.org/0000-0002-3859-9229"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Abraham P. Punnen","raw_affiliation_strings":["Department of Mathematics, Simon Fraser University, Surrey, BC V5A 1S6, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Simon Fraser University, Surrey, BC V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038343752","display_name":"Jasdeep Dhahan","orcid":"https://orcid.org/0009-0009-8394-9679"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Jasdeep Dhahan","raw_affiliation_strings":["Department of Mathematics, Simon Fraser University, Surrey, BC V5A 1S6, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Simon Fraser University, Surrey, BC V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5038343752"],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.3464,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.81915093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"17","issue":"5","first_page":"219","last_page":"219"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9134733080863953},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8061259984970093},{"id":"https://openalex.org/keywords/multipartite","display_name":"Multipartite","score":0.7664026021957397},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6027902364730835},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5390986204147339},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4357488751411438},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3875735402107239},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3322342336177826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32236140966415405},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.12617293000221252}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9134733080863953},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8061259984970093},{"id":"https://openalex.org/C166733315","wikidata":"https://www.wikidata.org/wiki/Q6934831","display_name":"Multipartite","level":4,"score":0.7664026021957397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6027902364730835},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5390986204147339},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4357488751411438},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3875735402107239},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3322342336177826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32236140966415405},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.12617293000221252},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a17050219","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17050219","pdf_url":"https://www.mdpi.com/1999-4893/17/5/219/pdf?version=1716018322","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:e79c067f9e464723a70c8895c54d639b","is_oa":true,"landing_page_url":"https://doaj.org/article/e79c067f9e464723a70c8895c54d639b","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 17, Iss 5, p 219 (2024)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a17050219","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17050219","pdf_url":"https://www.mdpi.com/1999-4893/17/5/219/pdf?version=1716018322","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7000781433","display_name":null,"funder_award_id":"NA","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4398138850.pdf"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1578651618","https://openalex.org/W1973108067","https://openalex.org/W1977673015","https://openalex.org/W1979423668","https://openalex.org/W1982713256","https://openalex.org/W2000840218","https://openalex.org/W2002284890","https://openalex.org/W2003902046","https://openalex.org/W2006293258","https://openalex.org/W2010669807","https://openalex.org/W2037140854","https://openalex.org/W2041754841","https://openalex.org/W2046709864","https://openalex.org/W2048947076","https://openalex.org/W2050524721","https://openalex.org/W2084894096","https://openalex.org/W2089402478","https://openalex.org/W2116638623","https://openalex.org/W2124475618","https://openalex.org/W2131397354","https://openalex.org/W2135814502","https://openalex.org/W2140043891","https://openalex.org/W2140631835","https://openalex.org/W2250294758","https://openalex.org/W2294347342","https://openalex.org/W2410078569","https://openalex.org/W2481783932","https://openalex.org/W2543350326","https://openalex.org/W2555367514","https://openalex.org/W2567449761","https://openalex.org/W2620796999","https://openalex.org/W2806852865","https://openalex.org/W2916470116","https://openalex.org/W2964003494","https://openalex.org/W3104695357","https://openalex.org/W3128148487","https://openalex.org/W4285031017","https://openalex.org/W6622565831","https://openalex.org/W6672997692","https://openalex.org/W6683355975","https://openalex.org/W6697195335"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W2168163332","https://openalex.org/W2381226549","https://openalex.org/W2030157764"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,104],"study":[4,21],"the":[5,18,24,37,75,89,95,136],"knapsack":[6,77],"problem":[7,38,78,137,145],"with":[8,79],"conflict":[9,29,35,80],"pair":[10,81],"constraints.":[11],"After":[12],"a":[13,68,160],"thorough":[14],"literature":[15],"survey":[16],"on":[17,23],"topic,":[19],"our":[20],"focuses":[22],"special":[25,154],"case":[26],"of":[27,55,62,70,94,98,113,132,135,144],"bipartite":[28,33],"graphs.":[30],"For":[31],"complete":[32],"(multipartite)":[34],"graphs,":[36],"is":[39,83,101],"shown":[40],"to":[41,58,108,119,141],"be":[42,150],"NP-hard":[43],"but":[44],"solvable":[45],"in":[46,152],"pseudo-polynomial":[47],"time,":[48],"and":[49,87,103,129,138],"it":[50],"admits":[51],"an":[52],"FPTAS.":[53],"Extensions":[54],"these":[56,99,114],"results":[57],"more":[59],"general":[60,76],"classes":[61],"graphs":[63],"are":[64,116],"also":[65,117],"presented.":[66],"Further,":[67],"class":[69],"integer":[71],"programming":[72],"models":[73,115],"for":[74,157],"constraints":[82],"presented,":[84],"which":[85],"generalizes":[86],"unifies":[88],"existing":[90],"formulations.":[91],"The":[92],"strength":[93],"LP":[96],"relaxations":[97],"formulations":[100,134],"analyzed,":[102],"discuss":[105],"different":[106,133,142],"ways":[107],"tighten":[109],"them.":[110],"Experimental":[111],"comparisons":[112],"presented":[118],"assess":[120],"their":[121,139],"relative":[122],"strengths.":[123],"This":[124,147],"analysis":[125],"disclosed":[126],"various":[127],"strong":[128],"weak":[130],"points":[131],"relationships":[140],"types":[143],"data.":[146],"information":[148],"can":[149],"used":[151],"designing":[153],"purpose":[155],"algorithms":[156],"KPCC":[158],"involving":[159],"learning":[161],"component.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2}],"updated_date":"2026-04-18T07:56:08.524223","created_date":"2025-10-10T00:00:00"}