{"id":"https://openalex.org/W2606875850","doi":"https://doi.org/10.3906/elk-1508-263","title":"Maximum size of the pareto cost sets for multi-constrained optimal routing","display_name":"Maximum size of the pareto cost sets for multi-constrained optimal routing","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2606875850","doi":"https://doi.org/10.3906/elk-1508-263","mag":"2606875850"},"language":"en","primary_location":{"id":"doi:10.3906/elk-1508-263","is_oa":false,"landing_page_url":"https://doi.org/10.3906/elk-1508-263","pdf_url":null,"source":{"id":"https://openalex.org/S32837994","display_name":"TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES","issn_l":"1300-0632","issn":["1300-0632","1303-6203"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318422","host_organization_name":"Scientific and Technological Research Council of Turkey (TUBITAK)","host_organization_lineage":["https://openalex.org/P4310318422"],"host_organization_lineage_names":["Scientific and Technological Research Council of Turkey (TUBITAK)"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"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/A5082950744","display_name":"Derya Yiltas-Kaplan","orcid":"https://orcid.org/0000-0001-8370-8941"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Derya YILTA\u015e KAPLAN","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082950744"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04532567,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":null,"first_page":"1211","last_page":"1222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976000189781189,"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.9976000189781189,"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.9959999918937683,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9939000010490417,"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/heuristics","display_name":"Heuristics","score":0.6991673707962036},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6300340890884399},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6082543730735779},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.556092381477356},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5381835699081421},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.49715641140937805},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.45475518703460693},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44159209728240967},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3936747908592224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32760298252105713},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06734338402748108}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6991673707962036},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6300340890884399},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6082543730735779},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.556092381477356},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5381835699081421},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.49715641140937805},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.45475518703460693},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44159209728240967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3936747908592224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32760298252105713},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06734338402748108},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3906/elk-1508-263","is_oa":false,"landing_page_url":"https://doi.org/10.3906/elk-1508-263","pdf_url":null,"source":{"id":"https://openalex.org/S32837994","display_name":"TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES","issn_l":"1300-0632","issn":["1300-0632","1303-6203"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318422","host_organization_name":"Scientific and Technological Research Council of Turkey (TUBITAK)","host_organization_lineage":["https://openalex.org/P4310318422"],"host_organization_lineage_names":["Scientific and Technological Research Council of Turkey (TUBITAK)"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES","raw_type":"journal-article"},{"id":"pmh:oai:dergipark.gov.tr:article/400413","is_oa":false,"landing_page_url":"http://dergipark.gov.tr/tbtkelektrik/issue/35783/400413","pdf_url":null,"source":{"id":"https://openalex.org/S4306401840","display_name":"DergiPark (Istanbul University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67581229","host_organization_name":"Istanbul University","host_organization_lineage":["https://openalex.org/I67581229"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"\\n                                                                    Volume: 25, Issue: 2\\n                                                                                                    1211-1222\\n                                                                \\n                            ","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dergipark.org.tr:article/400413","is_oa":false,"landing_page_url":"https://dergipark.org.tr/tr/pub/tbtkelektrik/issue/35783/400413","pdf_url":null,"source":{"id":"https://openalex.org/S4306401840","display_name":"DergiPark (Istanbul University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67581229","host_organization_name":"Istanbul University","host_organization_lineage":["https://openalex.org/I67581229"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"\\n                                                                    Volume: 25, Issue: 2\\n                                                                                                    1211-1222\\n                                                                \\n                            ","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2401723157","https://openalex.org/W2952904874","https://openalex.org/W324626582","https://openalex.org/W4389302559","https://openalex.org/W1690653314"],"abstract_inverted_index":{"Routing":[0],"under":[1],"multiple":[2,54,64],"independent":[3],"constrains":[4],"in":[5,32,106,109,132],"point-to-point":[6],"networks":[7,95],"has":[8,47],"been":[9,30,48],"studied":[10],"for":[11,51,79,91],"over":[12],"10":[13],"years.":[14,34],"Its":[15],"NP-hardness":[16],"keeps":[17],"pushing":[18],"researchers":[19],"to":[20],"study":[21],"approximate":[22],"algorithms":[23],"and":[24,26],"heuristics,":[25],"many":[27],"results":[28,139],"have":[29],"published":[31],"these":[33],"To":[35],"the":[36,41,52,110,128,133],"best":[37],"of":[38,43,127,130],"our":[39,80,143],"knowledge,":[40],"nature":[42],"its":[44,116],"average":[45,81,117],"case":[46,82,118],"explored":[49],"only":[50],"self-adaptive":[53],"constraints":[55,65],"routing":[56],"algorithm":[57,62,86],"(SAMCRA),":[58],"which":[59],"is":[60,77,121],"an":[61],"about":[63],"routing.":[66],"In":[67],"this":[68],"paper,":[69],"we":[70,113,136],"simplify":[71],"SAMCRA":[72],"into":[73],"a":[74,124],"format":[75],"that":[76,115,140],"convenient":[78],"analysis.":[83],"This":[84],"variant":[85],"gives":[87],"optimal":[88],"solutions":[89],"also":[90],"very":[92],"large":[93],"dimensional":[94],"such":[96],"as":[97],"with":[98,142],"more":[99],"than":[100],"1000":[101],"nodes.":[102],"Although":[103],"it":[104],"runs":[105],"exponential":[107],"time":[108,119],"worst":[111],"case,":[112],"prove":[114],"complexity":[120],"bounded":[122],"by":[123],"polynomial":[125],"function":[126],"number":[129],"nodes":[131],"network.":[134],"Lastly,":[135],"give":[137],"empirical":[138],"align":[141],"theoretical":[144],"work.":[145]},"counts_by_year":[],"updated_date":"2026-06-04T06:14:18.571774","created_date":"2025-10-10T00:00:00"}