{"id":"https://openalex.org/W2093840087","doi":"https://doi.org/10.1007/s10288-005-0078-6","title":"Complexity and algorithms for convex network optimization and other nonlinear problems","display_name":"Complexity and algorithms for convex network optimization and other nonlinear problems","publication_year":2005,"publication_date":"2005-09-01","ids":{"openalex":"https://openalex.org/W2093840087","doi":"https://doi.org/10.1007/s10288-005-0078-6","mag":"2093840087"},"language":"en","primary_location":{"id":"doi:10.1007/s10288-005-0078-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-005-0078-6","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"4OR","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/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, 94720, Berkeley, USA","University of California, Walter A. Haas School of Business, 94720, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, 94720, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, Walter A. Haas School of Business, 94720, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085640376"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":1.0115,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.78120006,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":"3","first_page":"171","last_page":"216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9937999844551086,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9884999990463257,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.5975574254989624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5262041687965393},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5119212865829468},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49592408537864685},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4933442175388336},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.4872256815433502},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4808581471443176},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.4658418893814087},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42932772636413574},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.4216906726360321},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4000087082386017},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32510611414909363}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5975574254989624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5262041687965393},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5119212865829468},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49592408537864685},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4933442175388336},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.4872256815433502},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4808581471443176},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.4658418893814087},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42932772636413574},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.4216906726360321},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4000087082386017},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32510611414909363},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10288-005-0078-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10288-005-0078-6","pdf_url":null,"source":{"id":"https://openalex.org/S4210191715","display_name":"4OR","issn_l":"1614-2411","issn":["1614-2411","1619-4500"],"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":"4OR","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W41039768","https://openalex.org/W47264501","https://openalex.org/W201713329","https://openalex.org/W1505731132","https://openalex.org/W1600795850","https://openalex.org/W1966229055","https://openalex.org/W1968119063","https://openalex.org/W1968988195","https://openalex.org/W1972505767","https://openalex.org/W1973069886","https://openalex.org/W1975879472","https://openalex.org/W1977545325","https://openalex.org/W1977895455","https://openalex.org/W1978119584","https://openalex.org/W1979556467","https://openalex.org/W1984313645","https://openalex.org/W1987675495","https://openalex.org/W1993200481","https://openalex.org/W1995246641","https://openalex.org/W1996641400","https://openalex.org/W1997012643","https://openalex.org/W2000079083","https://openalex.org/W2007619042","https://openalex.org/W2011039300","https://openalex.org/W2013347084","https://openalex.org/W2013469283","https://openalex.org/W2019315437","https://openalex.org/W2029950920","https://openalex.org/W2046715803","https://openalex.org/W2053352956","https://openalex.org/W2053913299","https://openalex.org/W2055544843","https://openalex.org/W2057927002","https://openalex.org/W2061274033","https://openalex.org/W2065356639","https://openalex.org/W2071959614","https://openalex.org/W2072492565","https://openalex.org/W2073363775","https://openalex.org/W2075322358","https://openalex.org/W2079135578","https://openalex.org/W2080375462","https://openalex.org/W2086856252","https://openalex.org/W2090359754","https://openalex.org/W2097155690","https://openalex.org/W2103985627","https://openalex.org/W2104452301","https://openalex.org/W2107026734","https://openalex.org/W2113195911","https://openalex.org/W2115815938","https://openalex.org/W2125908765","https://openalex.org/W2127470768","https://openalex.org/W2128208761","https://openalex.org/W2130025413","https://openalex.org/W2149342630","https://openalex.org/W2150154671","https://openalex.org/W2150855695","https://openalex.org/W2156347727","https://openalex.org/W2163608165","https://openalex.org/W2168825111","https://openalex.org/W2169278451","https://openalex.org/W2478623272","https://openalex.org/W2480247681","https://openalex.org/W2752853835","https://openalex.org/W2787523326","https://openalex.org/W2911796152","https://openalex.org/W2912730163"],"related_works":["https://openalex.org/W241127407","https://openalex.org/W2381035939","https://openalex.org/W2468477307","https://openalex.org/W2910645127","https://openalex.org/W162895179","https://openalex.org/W1521824362","https://openalex.org/W3177799343","https://openalex.org/W3119198325","https://openalex.org/W623642078","https://openalex.org/W4287599015"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
