{"id":"https://openalex.org/W2047609571","doi":"https://doi.org/10.1007/s10107-003-0423-5","title":"Stronger linear programming relaxations of max-cut","display_name":"Stronger linear programming relaxations of max-cut","publication_year":2003,"publication_date":"2003-08-01","ids":{"openalex":"https://openalex.org/W2047609571","doi":"https://doi.org/10.1007/s10107-003-0423-5","mag":"2047609571"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-003-0423-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0423-5","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/A5020530779","display_name":"David Avis","orcid":null},"institutions":[{"id":"https://openalex.org/I4210133247","display_name":"Group for Research in Decision Analysis","ror":"https://ror.org/02pkvpx84","country_code":"CA","type":"facility","lineage":["https://openalex.org/I108192572","https://openalex.org/I159129438","https://openalex.org/I4210133247","https://openalex.org/I45683168","https://openalex.org/I49663120","https://openalex.org/I5023651"]},{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"David Avis","raw_affiliation_strings":["Computer Science, Mcgill University and GERAD, 3480, University, Montreal, Quebec, Canada, H3A 2A7"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science, Mcgill University and GERAD, 3480, University, Montreal, Quebec, Canada, H3A 2A7","institution_ids":["https://openalex.org/I4210133247","https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009954144","display_name":"Jun Umemoto","orcid":null},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Jun Umemoto","raw_affiliation_strings":["Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto, Japan, 606-8501"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto, Japan, 606-8501","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020530779"],"corresponding_institution_ids":["https://openalex.org/I4210133247","https://openalex.org/I5023651"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.7301,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.71446656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"97","issue":"3","first_page":"451","last_page":"469"},"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.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9948999881744385,"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.8589596748352051},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5950162410736084},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5669300556182861},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5477508902549744},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5437745451927185},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.4666137099266052},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4234920144081116},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4118473529815674},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25133997201919556},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21089529991149902},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10527580976486206}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8589596748352051},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5950162410736084},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5669300556182861},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5477508902549744},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5437745451927185},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.4666137099266052},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4234920144081116},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4118473529815674},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25133997201919556},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21089529991149902},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10527580976486206}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-003-0423-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-003-0423-5","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":[{"score":0.5099999904632568,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W171715212","https://openalex.org/W1985142495","https://openalex.org/W1985284097","https://openalex.org/W2012605254","https://openalex.org/W2027048490","https://openalex.org/W2042587503","https://openalex.org/W2064509437","https://openalex.org/W2084788931","https://openalex.org/W2099945345","https://openalex.org/W2917997019"],"related_works":["https://openalex.org/W2055782437","https://openalex.org/W2107689258","https://openalex.org/W2141353198","https://openalex.org/W4205854323","https://openalex.org/W2115855742","https://openalex.org/W3149578574","https://openalex.org/W2059496069","https://openalex.org/W4387578030","https://openalex.org/W2378280103","https://openalex.org/W4206993075"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}