{"id":"https://openalex.org/W3124896382","doi":"https://doi.org/10.1137/s0097539703431007","title":"Approximate Local Search in Combinatorial Optimization","display_name":"Approximate Local Search in Combinatorial Optimization","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W3124896382","doi":"https://doi.org/10.1137/s0097539703431007","mag":"3124896382"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539703431007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703431007","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","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/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["MIT Sloan School of Management"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Sloan School of Management","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079361771","display_name":"Abraham P. Punnen","orcid":"https://orcid.org/0000-0002-3859-9229"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abraham P. Punnen","raw_affiliation_strings":["MIT Sloan School of Management"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Sloan School of Management","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103095757","display_name":"Andreas S. Schulz","orcid":"https://orcid.org/0000-0002-9595-459X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andreas S. Schulz","raw_affiliation_strings":["MIT Sloan School of Management"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT Sloan School of Management","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.9395,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.95772457,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"33","issue":"5","first_page":"1201","last_page":"1214"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9990000128746033,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.728963315486908},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6882442235946655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6680673956871033},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.6271875500679016},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.612299919128418},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6008561849594116},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5700505971908569},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.47980955243110657},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44124504923820496},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4374582767486572},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3283834457397461},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2990184426307678}],"concepts":[{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.728963315486908},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6882442235946655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6680673956871033},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.6271875500679016},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.612299919128418},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6008561849594116},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5700505971908569},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.47980955243110657},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44124504923820496},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4374582767486572},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3283834457397461},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2990184426307678},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539703431007","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539703431007","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4399999976158142,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1975220965","https://openalex.org/W2027764232","https://openalex.org/W2031178115","https://openalex.org/W2047820376","https://openalex.org/W2062459871","https://openalex.org/W2069323107","https://openalex.org/W2079868147","https://openalex.org/W2086917808","https://openalex.org/W2089117840","https://openalex.org/W2093399001","https://openalex.org/W2103981148","https://openalex.org/W2128193809","https://openalex.org/W2137614705","https://openalex.org/W2137849348","https://openalex.org/W2148673189","https://openalex.org/W2159579504","https://openalex.org/W2161455936","https://openalex.org/W2913132751","https://openalex.org/W4297399141"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2048358792","https://openalex.org/W2098281589","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W2962917430","https://openalex.org/W1903284337","https://openalex.org/W3124896382","https://openalex.org/W2031636249"],"abstract_inverted_index":{"Local":[0],"search":[1],"algorithms":[2,15],"for":[3,20,25,39,78],"combinatorial":[4,107],"optimization":[5,27,108],"problems":[6],"are":[7,16],"generally":[8],"of":[9,33,84,122],"pseudopolynomial":[10],"running":[11],"time,":[12],"and":[13,36,57,101,117],"polynomial-time":[14,113,134],"not":[17],"often":[18],"known":[19],"finding":[21],"locally":[22],"optimal":[23],"solutions":[24],"NP-hard":[26],"problems.":[28],"We":[29],"introduce":[30],"the":[31,54,60,70,98,120],"concept":[32],"$\\varepsilon$-local":[34,45],"optimality":[35],"show":[37],"that,":[38],"every":[40],"$\\varepsilon":[41],">":[42],"0$,":[43],"an":[44,128],"optimum":[46,93],"can":[47,63,72],"be":[48,64,73],"identified":[49],"in":[50,53,66,75,94,97,127],"time":[51,77,95],"polynomial":[52,67,76,96],"problem":[55,99,109,121],"size":[56,100],"$1/\\varepsilon$":[58],"whenever":[59],"corresponding":[61],"neighborhood":[62,71,130],"searched":[65,74],"time.":[68],"If":[69],"a":[79,82,89,104,106,111,124,132],"$\\delta$-local":[80],"optimum,":[81],"variation":[83],"our":[85],"main":[86],"algorithm":[87],"produces":[88],"$(\\delta":[90],"+":[91],"\\varepsilon)$-local":[92],"$1/\\varepsilon$.":[102],"As":[103],"consequence,":[105],"has":[110,131],"fully":[112,133],"approximation":[114,135],"scheme":[115],"if":[116,119],"only":[118],"determining":[123],"better":[125],"neighbor":[126],"exact":[129],"scheme.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}