{"id":"https://openalex.org/W2003965618","doi":"https://doi.org/10.1080/00207160410001684352","title":"A simulated annealing algorithm for the maximum planar subgraph problem","display_name":"A simulated annealing algorithm for the maximum planar subgraph problem","publication_year":2004,"publication_date":"2004-05-01","ids":{"openalex":"https://openalex.org/W2003965618","doi":"https://doi.org/10.1080/00207160410001684352","mag":"2003965618"},"language":"en","primary_location":{"id":"doi:10.1080/00207160410001684352","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160410001684352","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5010118561","display_name":"Timo Poranen","orcid":"https://orcid.org/0000-0002-4638-0243"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Timo Poranen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5010118561"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4887,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.77279753,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"81","issue":"5","first_page":"555","last_page":"568"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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/planarity-testing","display_name":"Planarity testing","score":0.7444384694099426},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7440282106399536},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7306081056594849},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.6481869220733643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6187923550605774},{"id":"https://openalex.org/keywords/grasp","display_name":"GRASP","score":0.5372554659843445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48664483428001404},{"id":"https://openalex.org/keywords/adaptive-simulated-annealing","display_name":"Adaptive simulated annealing","score":0.4847392737865448},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4701649844646454},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.46629801392555237},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.44513025879859924},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43602582812309265},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4183824360370636},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3994782567024231},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3940609097480774},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.32868072390556335},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19779574871063232},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1290561854839325}],"concepts":[{"id":"https://openalex.org/C68260962","wikidata":"https://www.wikidata.org/wiki/Q7200967","display_name":"Planarity testing","level":2,"score":0.7444384694099426},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7440282106399536},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7306081056594849},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.6481869220733643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6187923550605774},{"id":"https://openalex.org/C171268870","wikidata":"https://www.wikidata.org/wiki/Q1486676","display_name":"GRASP","level":2,"score":0.5372554659843445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48664483428001404},{"id":"https://openalex.org/C46714192","wikidata":"https://www.wikidata.org/wiki/Q4680763","display_name":"Adaptive simulated annealing","level":3,"score":0.4847392737865448},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4701649844646454},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.46629801392555237},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.44513025879859924},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43602582812309265},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4183824360370636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3994782567024231},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3940609097480774},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.32868072390556335},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19779574871063232},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1290561854839325},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160410001684352","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160410001684352","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W112131548","https://openalex.org/W1535967299","https://openalex.org/W1543889792","https://openalex.org/W1559215823","https://openalex.org/W1587861032","https://openalex.org/W1968592790","https://openalex.org/W1981470489","https://openalex.org/W1987374783","https://openalex.org/W1999602035","https://openalex.org/W2015924510","https://openalex.org/W2024491681","https://openalex.org/W2036037092","https://openalex.org/W2038610533","https://openalex.org/W2043664398","https://openalex.org/W2045027193","https://openalex.org/W2048361468","https://openalex.org/W2052400534","https://openalex.org/W2056760934","https://openalex.org/W2066623726","https://openalex.org/W2075541196","https://openalex.org/W2084306999","https://openalex.org/W2089070935","https://openalex.org/W2106371135","https://openalex.org/W2111635834","https://openalex.org/W2128193809","https://openalex.org/W2153638045","https://openalex.org/W2168920762","https://openalex.org/W2170359320","https://openalex.org/W2171776966","https://openalex.org/W2799004609","https://openalex.org/W2914275007","https://openalex.org/W2997776631","https://openalex.org/W4242583213","https://openalex.org/W4302422232"],"related_works":["https://openalex.org/W122427932","https://openalex.org/W1571373126","https://openalex.org/W1555811547","https://openalex.org/W2360752711","https://openalex.org/W1491456715","https://openalex.org/W2731478787","https://openalex.org/W2962740289","https://openalex.org/W2990058916","https://openalex.org/W2902898487","https://openalex.org/W2085427851"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"introduce":[4],"a":[5,15,64],"new":[6],"heuristic":[7,74],"algorithm":[8,18,39,70,86],"for":[9,95],"finding":[10],"maximum":[11],"planar":[12,61],"subgraphs":[13,62],"of":[14,31,37,67],"graph.":[16],"Our":[17],"is":[19,55,77,83,87],"based":[20],"on":[21],"the":[22,29,32,96],"simulated":[23,53],"annealing":[24,54],"optimization":[25],"scheme.":[26],"We":[27,50],"compare":[28],"quality":[30,82],"solutions":[33],"and":[34,47,79],"running":[35],"times":[36],"our":[38],"with":[40,63],"greedy":[41],"randomized":[42],"adaptive":[43],"search":[44],"procedure":[45],"(GRASP)":[46],"branch-and-cut":[48],"heuristics.":[49],"show":[51],"that":[52],"an":[56,93],"efficient":[57],"method":[58],"to":[59],"find":[60],"large":[65],"number":[66],"edges.":[68],"The":[69,85],"clearly":[71],"outperforms":[72],"earlier":[73],"algorithms;":[75],"it":[76,91],"faster":[78],"its":[80],"solution":[81],"better.":[84],"very":[88],"simple,":[89],"although":[90],"needs":[92],"implementation":[94],"planarity":[97],"test.":[98]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}