{"id":"https://openalex.org/W2085595139","doi":"https://doi.org/10.1137/0805024","title":"Nonpolyhedral Relaxations of Graph-Bisection Problems","display_name":"Nonpolyhedral Relaxations of Graph-Bisection Problems","publication_year":1995,"publication_date":"1995-08-01","ids":{"openalex":"https://openalex.org/W2085595139","doi":"https://doi.org/10.1137/0805024","mag":"2085595139"},"language":"en","primary_location":{"id":"doi:10.1137/0805024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805024","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5108397775","display_name":"Svatopluk Poljak","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Svatopluk Poljak","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5036114620","display_name":"Franz Rendl","orcid":"https://orcid.org/0000-0003-1578-9414"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Franz Rendl","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.9448,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.98539048,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"5","issue":"3","first_page":"467","last_page":"487"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976000189781189,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9925000071525574,"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/mathematics","display_name":"Mathematics","score":0.8232608437538147},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6304738521575928},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5712336301803589},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5483841896057129},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5313727855682373},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5305481553077698},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5285072922706604},{"id":"https://openalex.org/keywords/bisection","display_name":"Bisection","score":0.47287389636039734},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.46673285961151123},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4659024178981781},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4446712136268616},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39751923084259033},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38706839084625244},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11880534887313843},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0686333179473877}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8232608437538147},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6304738521575928},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5712336301803589},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5483841896057129},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5313727855682373},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5305481553077698},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5285072922706604},{"id":"https://openalex.org/C31599958","wikidata":"https://www.wikidata.org/wiki/Q3128632","display_name":"Bisection","level":2,"score":0.47287389636039734},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.46673285961151123},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4659024178981781},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4446712136268616},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39751923084259033},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38706839084625244},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11880534887313843},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0686333179473877},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0805024","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805024","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.180","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.180","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dimacs.rutgers.edu/techps/1992/92-55.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.5454","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.5454","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fmatbhp1.tu-graz.ac.at/~helmberg/non_poly.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1982604350","https://openalex.org/W1985142495","https://openalex.org/W1999285709","https://openalex.org/W2014079391","https://openalex.org/W2021738735","https://openalex.org/W2033852356","https://openalex.org/W2041928877","https://openalex.org/W2060660073","https://openalex.org/W2069037000","https://openalex.org/W2076767912","https://openalex.org/W2084788931","https://openalex.org/W2092812429","https://openalex.org/W2099945345","https://openalex.org/W2144787788","https://openalex.org/W2159739530"],"related_works":["https://openalex.org/W2047625168","https://openalex.org/W2002177687","https://openalex.org/W2123785459","https://openalex.org/W2058438338","https://openalex.org/W41290553","https://openalex.org/W2144591547","https://openalex.org/W4287273005","https://openalex.org/W3135784370","https://openalex.org/W2776473626","https://openalex.org/W1966028935"],"abstract_inverted_index":{"We":[0,18,35,67],"study":[1],"the":[2,6,24,41,51,54,74,82],"problem":[3,25],"of":[4,9,15,33],"finding":[5],"minimum":[7],"bisection":[8],"a":[10,79,99],"graph":[11],"into":[12],"two":[13,20],"parts":[14],"prescribed":[16],"sizes.":[17],"formulate":[19],"lower":[21],"bounds":[22],"on":[23,65],"by":[26],"relaxing":[27],"node-":[28,58],"and":[29,57,77,85],"edge-":[30,56],"incidence":[31],"vectors":[32,59],"cuts.":[34,66],"prove":[36,48],"that":[37,50],"both":[38],"relaxations":[39],"provide":[40],"same":[42],"bound.":[43],"The":[44],"main":[45],"fact":[46],"we":[47,93],"is":[49],"duality":[52],"between":[53,81],"relaxed":[55],"preserves":[60],"very":[61],"natural":[62],"cardinality":[63],"constraints":[64],"present":[68],"an":[69],"analogous":[70],"result":[71],"also":[72],"for":[73,98],"max-cut":[75],"problem,":[76],"show":[78],"relation":[80],"edge":[83],"relaxation":[84],"some":[86],"other":[87],"optimality":[88],"criteria":[89],"studied":[90],"before.":[91],"Finally,":[92],"briefly":[94],"mention":[95],"possible":[96],"applications":[97],"practical":[100],"computational":[101],"approach.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}