{"id":"https://openalex.org/W4321081000","doi":"https://doi.org/10.1007/s10107-023-01932-w","title":"Efficient joint object matching via linear programming","display_name":"Efficient joint object matching via linear programming","publication_year":2023,"publication_date":"2023-02-16","ids":{"openalex":"https://openalex.org/W4321081000","doi":"https://doi.org/10.1007/s10107-023-01932-w"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-023-01932-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-023-01932-w","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-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/A5043926638","display_name":"Antonio De Rosa","orcid":"https://orcid.org/0000-0002-1392-4881"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Antonio De Rosa","raw_affiliation_strings":["Department of Mathematics, University of Maryland, 4176 Campus Dr, College Park, MD, 20742, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Maryland, 4176 Campus Dr, College Park, MD, 20742, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059503583","display_name":"Aida Khajavirad","orcid":"https://orcid.org/0000-0002-7097-1676"},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aida Khajavirad","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, 18015, USA"],"raw_orcid":"https://orcid.org/0000-0002-7097-1676","affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, 18015, USA","institution_ids":["https://openalex.org/I186143895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059503583"],"corresponding_institution_ids":["https://openalex.org/I186143895"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5819,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68922597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"202","issue":"1-2","first_page":"1","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9835000038146973,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9740999937057495,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7045273184776306},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5801032781600952},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5614686608314514},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5594256520271301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5474489331245422},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.509240984916687},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4507675766944885},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4225016236305237},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3570883274078369},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3526168465614319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34646204113960266},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34293031692504883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30087417364120483}],"concepts":[{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7045273184776306},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5801032781600952},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5614686608314514},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5594256520271301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5474489331245422},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.509240984916687},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4507675766944885},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4225016236305237},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3570883274078369},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3526168465614319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34646204113960266},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34293031692504883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30087417364120483},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-023-01932-w","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-023-01932-w","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.8199999928474426,"display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G175356605","display_name":null,"funder_award_id":"2112311","funder_id":"https://openalex.org/F4320332172","funder_display_name":"Directorate for Mathematical and Physical Sciences"},{"id":"https://openalex.org/G5183311970","display_name":null,"funder_award_id":"1906451","funder_id":"https://openalex.org/F4320332172","funder_display_name":"Directorate for Mathematical and Physical Sciences"}],"funders":[{"id":"https://openalex.org/F4320332172","display_name":"Directorate for Mathematical and Physical Sciences","ror":"https://ror.org/029b7h395"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1481140196","https://openalex.org/W1918816242","https://openalex.org/W1973069886","https://openalex.org/W1973520969","https://openalex.org/W1993052292","https://openalex.org/W2006293258","https://openalex.org/W2030488300","https://openalex.org/W2035575256","https://openalex.org/W2047893320","https://openalex.org/W2074078071","https://openalex.org/W2078992232","https://openalex.org/W2100440346","https://openalex.org/W2106292145","https://openalex.org/W2138505091","https://openalex.org/W2163446794","https://openalex.org/W2189538311","https://openalex.org/W2313058470","https://openalex.org/W2567866584","https://openalex.org/W2787248994","https://openalex.org/W2798147813","https://openalex.org/W2804302623","https://openalex.org/W2963264680","https://openalex.org/W2963685135","https://openalex.org/W2963865651","https://openalex.org/W3035512722","https://openalex.org/W3048770996","https://openalex.org/W3105558219","https://openalex.org/W3106489147","https://openalex.org/W4205305404","https://openalex.org/W4214500875","https://openalex.org/W4230371388","https://openalex.org/W4287764681","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W4252122881","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W4302819359","https://openalex.org/W1963627056","https://openalex.org/W1973873435","https://openalex.org/W2952452737","https://openalex.org/W2769220156","https://openalex.org/W1981191225","https://openalex.org/W2498361220"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}