{"id":"https://openalex.org/W2081269878","doi":"https://doi.org/10.1007/s00453-005-1177-7","title":"Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs","display_name":"Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs","publication_year":2005,"publication_date":"2005-10-17","ids":{"openalex":"https://openalex.org/W2081269878","doi":"https://doi.org/10.1007/s00453-005-1177-7","mag":"2081269878"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-005-1177-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-005-1177-7","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","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/A5101748190","display_name":"Ashish Goel","orcid":"https://orcid.org/0000-0003-0938-0401"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ashish Goel","raw_affiliation_strings":["Department of Management Science and Engineering and (by courtesy)\n  Computer Science, Stanford University, Stanford, CA 94305, USA","Department of Management Science and Engineering and (by courtesy)#N#  Computer Science, Stanford University, Stanford, CA 94305"],"affiliations":[{"raw_affiliation_string":"Department of Management Science and Engineering and (by courtesy)\n  Computer Science, Stanford University, Stanford, CA 94305, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Management Science and Engineering and (by courtesy)#N#  Computer Science, Stanford University, Stanford, CA 94305","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113788789","display_name":"Adam Meyerson","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam Meyerson","raw_affiliation_strings":["Department of Computer Science, University of California, Los Angeles, CA 90095, USA","Department of Computer Science, University of California, Los Angeles, CA 90095#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Los Angeles, CA 90095, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"Department of Computer Science, University of California, Los Angeles, CA 90095#TAB#","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101748190"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.2829,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.92950411,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"44","issue":"4","first_page":"301","last_page":"323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/majorization","display_name":"Majorization","score":0.7576764822006226},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.689255952835083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6145729422569275},{"id":"https://openalex.org/keywords/concave-function","display_name":"Concave function","score":0.6113812923431396},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5369797348976135},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5032603144645691},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4906846284866333},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48656025528907776},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44169604778289795},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4378662407398224},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42614060640335083},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.42067885398864746},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29517972469329834},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.24667119979858398},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14168497920036316}],"concepts":[{"id":"https://openalex.org/C2777818330","wikidata":"https://www.wikidata.org/wiki/Q1994695","display_name":"Majorization","level":2,"score":0.7576764822006226},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.689255952835083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6145729422569275},{"id":"https://openalex.org/C66690126","wikidata":"https://www.wikidata.org/wiki/Q2914302","display_name":"Concave function","level":3,"score":0.6113812923431396},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5369797348976135},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5032603144645691},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4906846284866333},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48656025528907776},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44169604778289795},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4378662407398224},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42614060640335083},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.42067885398864746},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29517972469329834},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24667119979858398},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14168497920036316},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":3,"locations":[{"id":"doi:10.1007/s00453-005-1177-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-005-1177-7","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.9629","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.9629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucla.edu/~awm/papers/majorize.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.79.8392","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.8392","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~ashishg/papers/simultaneous.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1617090913","https://openalex.org/W1891203375","https://openalex.org/W1966475329","https://openalex.org/W1980375431","https://openalex.org/W1990313671","https://openalex.org/W1992674660","https://openalex.org/W1993549051","https://openalex.org/W2001016215","https://openalex.org/W2006309149","https://openalex.org/W2014369282","https://openalex.org/W2021474514","https://openalex.org/W2035652501","https://openalex.org/W2044081853","https://openalex.org/W2044567090","https://openalex.org/W2070226247","https://openalex.org/W2070911930","https://openalex.org/W2089897116","https://openalex.org/W2093979815","https://openalex.org/W2100440346","https://openalex.org/W2102201348","https://openalex.org/W2113834527","https://openalex.org/W2121902703","https://openalex.org/W2122967269","https://openalex.org/W2129391890","https://openalex.org/W2134422938","https://openalex.org/W2142758253","https://openalex.org/W2143898135","https://openalex.org/W2158700277","https://openalex.org/W2163244890","https://openalex.org/W2165956524","https://openalex.org/W2613173048","https://openalex.org/W3041277256","https://openalex.org/W3144969279"],"related_works":["https://openalex.org/W371413493","https://openalex.org/W1988514170","https://openalex.org/W4320039931","https://openalex.org/W4214702501","https://openalex.org/W2050374035","https://openalex.org/W2058818213","https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W3004308771","https://openalex.org/W2093670428"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
