{"id":"https://openalex.org/W2768235245","doi":"https://doi.org/10.1109/codit.2017.8102558","title":"Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics","display_name":"Bipartite complete matching vertex interdiction problem with incompatibility constraints: Complexity and heuristics","publication_year":2017,"publication_date":"2017-04-01","ids":{"openalex":"https://openalex.org/W2768235245","doi":"https://doi.org/10.1109/codit.2017.8102558","mag":"2768235245"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2017.8102558","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2017.8102558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053521274","display_name":"Pierre Laroche","orcid":"https://orcid.org/0000-0002-2191-1335"},"institutions":[{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4210148061","display_name":"Laboratoire Mat\u00e9riaux Optiques, Photonique et Syst\u00e8mes","ror":"https://ror.org/055swm364","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210110412","https://openalex.org/I4210139971","https://openalex.org/I4210148061","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Laroche","raw_affiliation_strings":["Universit\u00e9 de Lorraine, Optimisation et Mod\u00e9lisation des Syst\u00e8mes, Metz, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, Optimisation et Mod\u00e9lisation des Syst\u00e8mes, Metz, France","institution_ids":["https://openalex.org/I4210148061","https://openalex.org/I90183372"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022627678","display_name":"Franc Marchetti","orcid":"https://orcid.org/0000-0001-7443-1143"},"institutions":[{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4210148061","display_name":"Laboratoire Mat\u00e9riaux Optiques, Photonique et Syst\u00e8mes","ror":"https://ror.org/055swm364","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210110412","https://openalex.org/I4210139971","https://openalex.org/I4210148061","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Franc Marchetti","raw_affiliation_strings":["Universit\u00e9 de Lorraine, Optimisation et Mod\u00e9lisation des Syst\u00e8mes, Metz, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, Optimisation et Mod\u00e9lisation des Syst\u00e8mes, Metz, France","institution_ids":["https://openalex.org/I4210148061","https://openalex.org/I90183372"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083892488","display_name":"S\u00e9bastien Martin","orcid":"https://orcid.org/0000-0002-8528-6698"},"institutions":[{"id":"https://openalex.org/I4210148061","display_name":"Laboratoire Mat\u00e9riaux Optiques, Photonique et Syst\u00e8mes","ror":"https://ror.org/055swm364","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210110412","https://openalex.org/I4210139971","https://openalex.org/I4210148061","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sebastien Martin","raw_affiliation_strings":["Universit\u00e9 de Lorraine, Optimisation et Mod\u00e9lisation des Syst\u00e8mes, Metz, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, Optimisation et Mod\u00e9lisation des Syst\u00e8mes, Metz, France","institution_ids":["https://openalex.org/I4210148061","https://openalex.org/I90183372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079750504","display_name":"Zsuzsanna R\u00f3ka","orcid":"https://orcid.org/0000-0002-2840-3608"},"institutions":[{"id":"https://openalex.org/I4210148061","display_name":"Laboratoire Mat\u00e9riaux Optiques, Photonique et Syst\u00e8mes","ror":"https://ror.org/055swm364","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210110412","https://openalex.org/I4210139971","https://openalex.org/I4210148061","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zsuzsanna Roka","raw_affiliation_strings":["Universit\u00e9 de Lorraine, Optimisation et Mod\u00e9lisation des Syst\u00e8mes, Metz, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, Optimisation et Mod\u00e9lisation des Syst\u00e8mes, Metz, France","institution_ids":["https://openalex.org/I4210148061","https://openalex.org/I90183372"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5053521274"],"corresponding_institution_ids":["https://openalex.org/I4210148061","https://openalex.org/I90183372"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19598424,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"0006","last_page":"0011"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9968000054359436,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.9693999886512756,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7217164039611816},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7193763256072998},{"id":"https://openalex.org/keywords/interdiction","display_name":"Interdiction","score":0.7086484432220459},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5515913963317871},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5396720170974731},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5282629728317261},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5176475644111633},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5122012495994568},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.48496460914611816},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.47069501876831055},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4590846598148346},{"id":"https://openalex.org/keywords/testbed","display_name":"Testbed","score":0.4545617699623108},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4259195327758789},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36892420053482056},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36729156970977783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35397869348526},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3403012752532959}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7217164039611816},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7193763256072998},{"id":"https://openalex.org/C124119293","wikidata":"https://www.wikidata.org/wiki/Q6046081","display_name":"Interdiction","level":2,"score":0.7086484432220459},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5515913963317871},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5396720170974731},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5282629728317261},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5176475644111633},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5122012495994568},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.48496460914611816},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.47069501876831055},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4590846598148346},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.4545617699623108},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4259195327758789},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36892420053482056},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36729156970977783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35397869348526},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3403012752532959},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/codit.2017.8102558","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2017.8102558","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-05515683v1","is_oa":false,"landing_page_url":"https://hal.univ-lorraine.fr/hal-05515683","pdf_url":null,"source":{"id":"https://openalex.org/S4406922398","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2017, Barcelona, Spain. 35, IEEE, pp.0006-0011, 2020, ⟨10.1109/CoDIT.2017.8102558⟩","raw_type":"Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2016721869","https://openalex.org/W2057111012","https://openalex.org/W2061236683","https://openalex.org/W2315398113","https://openalex.org/W3138559013","https://openalex.org/W6791780340"],"related_works":["https://openalex.org/W2383239740","https://openalex.org/W4353080490","https://openalex.org/W3202113264","https://openalex.org/W2590595849","https://openalex.org/W66562208","https://openalex.org/W2341912396","https://openalex.org/W2125708920","https://openalex.org/W2009688407","https://openalex.org/W1980128611","https://openalex.org/W2370475393"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,77],"consider":[4],"the":[5,19,26,36,79,86],"bipartite":[6],"complete":[7],"matching":[8],"vertex":[9],"interdiction":[10],"problem,":[11],"taking":[12],"into":[13],"account":[14],"some":[15],"incompatibilities":[16],"existing":[17],"among":[18],"resources":[20,40],"to":[21,62,84],"assign.":[22],"This":[23,58],"problem":[24,59,87],"ensures":[25],"obtainment":[27],"of":[28,38],"a":[29,43,51,69,95,103],"robust":[30],"assignment,":[31],"which":[32],"is":[33,60],"defined":[34],"by":[35],"number":[37],"missing":[39],"still":[41],"allowing":[42,82],"valid":[44],"assignment.":[45],"We":[46],"introduce":[47],"graph":[48,80],"formulations,":[49],"considering":[50,67],"single":[52,70],"time":[53,71,75],"period":[54],"or":[55],"several":[56,74],"ones.":[57],"shown":[61],"be":[63],"NP-hard,":[64],"even":[65],"when":[66],"only":[68],"period.":[72],"For":[73],"periods,":[76],"adapt":[78],"formulation,":[81],"us":[83],"solve":[85],"using":[88],"polynomial":[89],"heuristics.":[90],"Two":[91],"greedy":[92],"algorithms":[93],"and":[94,100],"genetic":[96],"algorithm":[97],"are":[98],"proposed":[99],"compared":[101],"on":[102],"randomly-generated":[104],"testbed.":[105]},"counts_by_year":[],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}