{"id":"https://openalex.org/W2064500313","doi":"https://doi.org/10.1007/bf01951543","title":"NP-Complete operations research problems and approximation algorithms","display_name":"NP-Complete operations research problems and approximation algorithms","publication_year":1979,"publication_date":"1979-06-01","ids":{"openalex":"https://openalex.org/W2064500313","doi":"https://doi.org/10.1007/bf01951543","mag":"2064500313"},"language":"de","primary_location":{"id":"doi:10.1007/bf01951543","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01951543","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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":"Zeitschrift f\u00fcr Operations Research","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/A5000179258","display_name":"Peter Brucker","orcid":null},"institutions":[{"id":"https://openalex.org/I129877168","display_name":"Carl von Ossietzky Universit\u00e4t Oldenburg","ror":"https://ror.org/033n9gh91","country_code":"DE","type":"education","lineage":["https://openalex.org/I129877168"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Peter Brucker","raw_affiliation_strings":["Fachbereich IV der Universit\u00e4t Oldenburg, Postfach 2503, D-Oldenburg","Fachbereich IV der Universit\u00e4t, Oldenburg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Fachbereich IV der Universit\u00e4t Oldenburg, Postfach 2503, D-Oldenburg","institution_ids":["https://openalex.org/I129877168"]},{"raw_affiliation_string":"Fachbereich IV der Universit\u00e4t, Oldenburg","institution_ids":["https://openalex.org/I129877168"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000179258"],"corresponding_institution_ids":["https://openalex.org/I129877168"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":6.4361,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.95532915,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"3","first_page":"73","last_page":"94"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/knapsack-problem","display_name":"Knapsack problem","score":0.8130187392234802},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7214621305465698},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7142207622528076},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5520437955856323},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.5218852162361145},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5080564022064209},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4884702265262604},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4661285877227783},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.4488822817802429},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.4386482834815979},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43559131026268005},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42811480164527893},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4151424169540405},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4135361313819885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4112909734249115},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.33726727962493896},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.24031534790992737}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8130187392234802},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7214621305465698},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7142207622528076},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5520437955856323},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.5218852162361145},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5080564022064209},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4884702265262604},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4661285877227783},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.4488822817802429},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.4386482834815979},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43559131026268005},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42811480164527893},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4151424169540405},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4135361313819885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4112909734249115},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.33726727962493896},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.24031534790992737},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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":1,"locations":[{"id":"doi:10.1007/bf01951543","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01951543","pdf_url":null,"source":{"id":"https://openalex.org/S126160977","display_name":"Mathematical Methods of Operations Research","issn_l":"1432-2994","issn":["1432-2994","1432-5217"],"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":"Zeitschrift f\u00fcr Operations Research","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":64,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W331797721","https://openalex.org/W634463279","https://openalex.org/W1554451661","https://openalex.org/W1569458199","https://openalex.org/W1589616492","https://openalex.org/W1967955864","https://openalex.org/W1973315504","https://openalex.org/W1976306508","https://openalex.org/W1978732961","https://openalex.org/W1979840049","https://openalex.org/W1982222968","https://openalex.org/W1991540883","https://openalex.org/W1992734168","https://openalex.org/W1995246641","https://openalex.org/W1997783781","https://openalex.org/W2000153313","https://openalex.org/W2000304327","https://openalex.org/W2003160050","https://openalex.org/W2009232680","https://openalex.org/W2009990213","https://openalex.org/W2019133545","https://openalex.org/W2026891055","https://openalex.org/W2027662813","https://openalex.org/W2030087828","https://openalex.org/W2031612682","https://openalex.org/W2032950184","https://openalex.org/W2036265926","https://openalex.org/W2036711992","https://openalex.org/W2040035940","https://openalex.org/W2040877664","https://openalex.org/W2042986967","https://openalex.org/W2043862089","https://openalex.org/W2048905935","https://openalex.org/W2052768371","https://openalex.org/W2057392949","https://openalex.org/W2066194644","https://openalex.org/W2067297441","https://openalex.org/W2080169294","https://openalex.org/W2081063310","https://openalex.org/W2087818742","https://openalex.org/W2089047615","https://openalex.org/W2089269509","https://openalex.org/W2093229192","https://openalex.org/W2095381673","https://openalex.org/W2097025565","https://openalex.org/W2104680817","https://openalex.org/W2106231890","https://openalex.org/W2109155166","https://openalex.org/W2136156086","https://openalex.org/W2143037347","https://openalex.org/W2147799577","https://openalex.org/W2147806352","https://openalex.org/W2150446509","https://openalex.org/W2154305205","https://openalex.org/W2157846217","https://openalex.org/W2172285784","https://openalex.org/W2177002043","https://openalex.org/W2339337913","https://openalex.org/W2401610261","https://openalex.org/W2743045177","https://openalex.org/W4246354717","https://openalex.org/W6620272070","https://openalex.org/W6633204241"],"related_works":["https://openalex.org/W2087209118","https://openalex.org/W2993365626","https://openalex.org/W2972694565","https://openalex.org/W179363847","https://openalex.org/W2426865915","https://openalex.org/W2561020507","https://openalex.org/W3161231593","https://openalex.org/W3171554204","https://openalex.org/W2064477811","https://openalex.org/W128408443"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}