{"id":"https://openalex.org/W1966902774","doi":"https://doi.org/10.1016/s0166-218x(03)00358-5","title":"Cardinality constrained minimum cut problems: complexity and algorithms","display_name":"Cardinality constrained minimum cut problems: complexity and algorithms","publication_year":2003,"publication_date":"2003-08-08","ids":{"openalex":"https://openalex.org/W1966902774","doi":"https://doi.org/10.1016/s0166-218x(03)00358-5","mag":"1966902774"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(03)00358-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(03)00358-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X03003585/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/S0166218X03003585/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076682055","display_name":"Maurizio Bruglieri","orcid":"https://orcid.org/0000-0002-4517-873X"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Maurizio Bruglieri","raw_affiliation_strings":["Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy","Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci, 32-20133, Milano, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy","institution_ids":["https://openalex.org/I93860229"]},{"raw_affiliation_string":"Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci, 32-20133, Milano, Italy#TAB#","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053677027","display_name":"Francesco Maffioli","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Francesco Maffioli","raw_affiliation_strings":["Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy","Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci, 32-20133, Milano, Italy#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci 32, 20133 Milano, Italy","institution_ids":["https://openalex.org/I93860229"]},{"raw_affiliation_string":"Dipartimento di Elettronica e Informazione, Politecnico di Milano, Piazza Leonardo da Vinci, 32-20133, Milano, Italy#TAB#","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019869178","display_name":"Matthias Ehrgott","orcid":"https://orcid.org/0000-0003-4648-4066"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ"],"is_corresponding":true,"raw_author_name":"Matthias Ehrgott","raw_affiliation_strings":["Department of Engineering Science, University of Auckland, Private Bag 92019, Auckland, New Zealand","Department of Engineering Science, University of Auckland, Private Bag\u200992019, Auckland, New Zealand"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Engineering Science, University of Auckland, Private Bag 92019, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Department of Engineering Science, University of Auckland, Private Bag\u200992019, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019869178","https://openalex.org/A5053677027","https://openalex.org/A5076682055"],"corresponding_institution_ids":["https://openalex.org/I154130895","https://openalex.org/I93860229"],"apc_list":{"value":2750,"currency":"USD","value_usd":2750},"apc_paid":null,"fwci":3.804,"has_fulltext":true,"cited_by_count":24,"citation_normalized_percentile":{"value":0.91842303,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"137","issue":"3","first_page":"311","last_page":"341"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9976999759674072,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962999820709229,"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/mathematics","display_name":"Mathematics","score":0.7684619426727295},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7505815029144287},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.650230884552002},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6135337352752686},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5113703608512878},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47336146235466003},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4177193343639374},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4172939956188202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38862279057502747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38763871788978577},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3670152425765991},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3333866596221924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1605989933013916}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7684619426727295},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7505815029144287},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.650230884552002},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6135337352752686},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5113703608512878},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47336146235466003},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4177193343639374},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4172939956188202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38862279057502747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38763871788978577},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3670152425765991},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3333866596221924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1605989933013916},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0166-218x(03)00358-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(03)00358-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X03003585/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:re.public.polimi.it:11311/555764","is_oa":false,"landing_page_url":"http://hdl.handle.net/11311/555764","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/s0166-218x(03)00358-5","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(03)00358-5","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X03003585/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1966902774.pdf","grobid_xml":"https://content.openalex.org/works/W1966902774.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W15553240","https://openalex.org/W572922989","https://openalex.org/W1211282206","https://openalex.org/W1512148653","https://openalex.org/W1590145340","https://openalex.org/W1601503375","https://openalex.org/W1964695196","https://openalex.org/W1971724331","https://openalex.org/W1985123706","https://openalex.org/W1999613943","https://openalex.org/W2005944337","https://openalex.org/W2007563254","https://openalex.org/W2011039300","https://openalex.org/W2030087828","https://openalex.org/W2050735826","https://openalex.org/W2057463094","https://openalex.org/W2061387890","https://openalex.org/W2080132708","https://openalex.org/W2081846387","https://openalex.org/W2082796773","https://openalex.org/W2085427851","https://openalex.org/W2085595139","https://openalex.org/W2114651839","https://openalex.org/W2122466336","https://openalex.org/W2128978199","https://openalex.org/W2130045784","https://openalex.org/W2151237529","https://openalex.org/W2159739530","https://openalex.org/W2495457432","https://openalex.org/W2601390891","https://openalex.org/W2610729871","https://openalex.org/W4235948408","https://openalex.org/W4236134006","https://openalex.org/W4285719527","https://openalex.org/W6600610668"],"related_works":["https://openalex.org/W4301329442","https://openalex.org/W2953390393","https://openalex.org/W2027038333","https://openalex.org/W2112825959","https://openalex.org/W2067948003","https://openalex.org/W2579720493","https://openalex.org/W2962740289","https://openalex.org/W2990058916","https://openalex.org/W2902898487","https://openalex.org/W2085427851"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}
