{"id":"https://openalex.org/W2013200539","doi":"https://doi.org/10.1007/pl00011425","title":"Optimization via enumeration: a new algorithm for the Max Cut Problem","display_name":"Optimization via enumeration: a new algorithm for the Max Cut Problem","publication_year":2001,"publication_date":"2001-04-01","ids":{"openalex":"https://openalex.org/W2013200539","doi":"https://doi.org/10.1007/pl00011425","mag":"2013200539"},"language":"en","primary_location":{"id":"doi:10.1007/pl00011425","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00011425","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/A5059021308","display_name":"Anna Galluccio","orcid":null},"institutions":[{"id":"https://openalex.org/I4210162062","display_name":"Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti","ror":"https://ror.org/054ye0e45","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210155236","https://openalex.org/I4210162062"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Anna Galluccio","raw_affiliation_strings":["Istituto di Analisi dei Sistemi ed Informatica \u2013 CNR, viale Manzoni 30, 00185 Roma, Italy, email: galluccio@iasi.rm.cnr.it, , , , , , IT","Istituto di Analisi dei Sistemi ed Informatica \u2013 CNR, viale Manzoni 30, 00185 Roma, Italy, email:\u00a0galluccio@iasi.rm.cnr.it, , , , , , IT","Istituto di Analisi dei Sistemi ed Informatica \u2013 CNR, viale Manzoni 30, 00185 Roma, Italy, email:\u00a0galluccio@iasi.rm.cnr.it, , IT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica \u2013 CNR, viale Manzoni 30, 00185 Roma, Italy, email: galluccio@iasi.rm.cnr.it, , , , , , IT","institution_ids":["https://openalex.org/I4210162062"]},{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica \u2013 CNR, viale Manzoni 30, 00185 Roma, Italy, email:\u00a0galluccio@iasi.rm.cnr.it, , , , , , IT","institution_ids":["https://openalex.org/I4210162062"]},{"raw_affiliation_string":"Istituto di Analisi dei Sistemi ed Informatica \u2013 CNR, viale Manzoni 30, 00185 Roma, Italy, email:\u00a0galluccio@iasi.rm.cnr.it, , IT","institution_ids":["https://openalex.org/I4210162062"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038875605","display_name":"Martin Loebl","orcid":"https://orcid.org/0000-0001-7968-0376"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Martin Loebl","raw_affiliation_strings":["Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email: {loebl,vondrak}@kam.ms.mff.cuni.cz, , , , , , CZ","Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email:\u00a0{loebl,vondrak}@kam.ms.mff.cuni.cz, , , , , , CZ","Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email: {loebl,vondrak}@kam.ms.mff.cuni.cz, CZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email: {loebl,vondrak}@kam.ms.mff.cuni.cz, , , , , , CZ","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email:\u00a0{loebl,vondrak}@kam.ms.mff.cuni.cz, , , , , , CZ","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email: {loebl,vondrak}@kam.ms.mff.cuni.cz, CZ","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003968234","display_name":"J. Vondr\u00e1k","orcid":"https://orcid.org/0000-0002-4674-0771"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Vondr\u00e1k","raw_affiliation_strings":["Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email: {loebl,vondrak}@kam.ms.mff.cuni.cz, , , , , , CZ","Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email:\u00a0{loebl,vondrak}@kam.ms.mff.cuni.cz, , , , , , CZ","Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email: {loebl,vondrak}@kam.ms.mff.cuni.cz, CZ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email: {loebl,vondrak}@kam.ms.mff.cuni.cz, , , , , , CZ","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email:\u00a0{loebl,vondrak}@kam.ms.mff.cuni.cz, , , , , , CZ","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Applied Mathematics, Charles University, Malostr\u00e1nske n\u00e1m. 25, 11800 Praha, Czech Republic, email: {loebl,vondrak}@kam.ms.mff.cuni.cz, CZ","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":1.9188,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.85547859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"90","issue":"2","first_page":"273","last_page":"290"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8256144523620605},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6414945125579834},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5552055835723877},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5064350366592407},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4848681390285492},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.48058128356933594},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4442996382713318},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43121272325515747},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4141646921634674},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4061945080757141},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1261356770992279},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.097889244556427}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8256144523620605},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6414945125579834},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5552055835723877},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5064350366592407},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4848681390285492},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.48058128356933594},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4442996382713318},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43121272325515747},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4141646921634674},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4061945080757141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1261356770992279},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.097889244556427},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00011425","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00011425","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W291625388","https://openalex.org/W1952454332","https://openalex.org/W1970824455","https://openalex.org/W1982250981","https://openalex.org/W1985123706","https://openalex.org/W2013520638","https://openalex.org/W2016832592","https://openalex.org/W2021738735","https://openalex.org/W2034612530","https://openalex.org/W2065007370","https://openalex.org/W2086594215","https://openalex.org/W2092812429","https://openalex.org/W2094125673","https://openalex.org/W2096486078","https://openalex.org/W2113679823","https://openalex.org/W2137541800","https://openalex.org/W2159739530","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1605732978","https://openalex.org/W2497378183","https://openalex.org/W3199424936","https://openalex.org/W1978042415","https://openalex.org/W4283012379","https://openalex.org/W2112972328","https://openalex.org/W3003396734","https://openalex.org/W2170520833","https://openalex.org/W1978343600","https://openalex.org/W4298028410"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}