{"id":"https://openalex.org/W2755627271","doi":"https://doi.org/10.1093/comjnl/bxx085","title":"On Handelman\u2019s Representation of Network Utility Maximization","display_name":"On Handelman\u2019s Representation of Network Utility Maximization","publication_year":2017,"publication_date":"2017-08-24","ids":{"openalex":"https://openalex.org/W2755627271","doi":"https://doi.org/10.1093/comjnl/bxx085","mag":"2755627271"},"language":"en","primary_location":{"id":"doi:10.1093/comjnl/bxx085","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxx085","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","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/A5025702566","display_name":"Tua A. Tamba","orcid":"https://orcid.org/0000-0003-4702-1100"},"institutions":[{"id":"https://openalex.org/I137666373","display_name":"Parahyangan Catholic University","ror":"https://ror.org/01texbd31","country_code":"ID","type":"education","lineage":["https://openalex.org/I137666373"]}],"countries":["ID"],"is_corresponding":true,"raw_author_name":"Tua A Tamba","raw_affiliation_strings":["Department of Electrical Engineering, Faculty of Industrial Technology, Parahyangan Catholic University, Bandung 40141, Indonesia"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Faculty of Industrial Technology, Parahyangan Catholic University, Bandung 40141, Indonesia","institution_ids":["https://openalex.org/I137666373"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025702566"],"corresponding_institution_ids":["https://openalex.org/I137666373"],"apc_list":{"value":2635,"currency":"GBP","value_usd":3232},"apc_paid":null,"fwci":0.9604,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.73802009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"61","issue":"6","first_page":"798","last_page":"807"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9883999824523926,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.6960830092430115},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6438193321228027},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6272751688957214},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5530873537063599},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5216834545135498},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5146580338478088},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.514628529548645},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48434174060821533},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.45738428831100464},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4341161847114563},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.4107978343963623}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6960830092430115},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6438193321228027},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6272751688957214},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5530873537063599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5216834545135498},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5146580338478088},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.514628529548645},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48434174060821533},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.45738428831100464},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4341161847114563},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.4107978343963623},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/comjnl/bxx085","is_oa":false,"landing_page_url":"https://doi.org/10.1093/comjnl/bxx085","pdf_url":null,"source":{"id":"https://openalex.org/S44643521","display_name":"The Computer Journal","issn_l":"0010-4620","issn":["0010-4620","1460-2067"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Computer Journal","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":31,"referenced_works":["https://openalex.org/W653291882","https://openalex.org/W1518341038","https://openalex.org/W1533615590","https://openalex.org/W1549638383","https://openalex.org/W1967184028","https://openalex.org/W1967344706","https://openalex.org/W1976541507","https://openalex.org/W1978884939","https://openalex.org/W1987497363","https://openalex.org/W2000033202","https://openalex.org/W2004746351","https://openalex.org/W2037009101","https://openalex.org/W2038888321","https://openalex.org/W2055993677","https://openalex.org/W2085352155","https://openalex.org/W2097050513","https://openalex.org/W2112356323","https://openalex.org/W2112947567","https://openalex.org/W2121938884","https://openalex.org/W2126658944","https://openalex.org/W2138322123","https://openalex.org/W2146586176","https://openalex.org/W2156568423","https://openalex.org/W2159715570","https://openalex.org/W2159743267","https://openalex.org/W2162986857","https://openalex.org/W2165281529","https://openalex.org/W2296319761","https://openalex.org/W2319466955","https://openalex.org/W2486781489","https://openalex.org/W4250589301"],"related_works":["https://openalex.org/W2367938014","https://openalex.org/W2201623492","https://openalex.org/W2107689258","https://openalex.org/W4205854323","https://openalex.org/W2115855742","https://openalex.org/W2059496069","https://openalex.org/W3149578574","https://openalex.org/W4387578030","https://openalex.org/W2378280103","https://openalex.org/W2903317563"],"abstract_inverted_index":{"This":[0],"paper":[1],"examines":[2],"a":[3,21],"linear":[4],"programming":[5],"(LP)":[6],"formulation":[7,17],"of":[8,28,36,43,56,83],"the":[9,26,37,41,44,51,68,80,84,94,100],"network":[10],"utility":[11,46,65],"maximization":[12],"problem.":[13],"Such":[14],"an":[15],"LP":[16,70],"is":[18,48,54,72],"inspired":[19],"by":[20],"convex":[22],"relaxation":[23],"technique":[24],"in":[25],"study":[27],"nonconvex":[29],"polynomial":[30],"optimization.":[31],"In":[32],"contrast":[33],"to":[34,75,99],"much":[35],"prior":[38],"works":[39],"where":[40],"concavity":[42],"network\u2019s":[45],"function":[47],"often":[49,97],"assumed,":[50],"proposed":[52],"method":[53],"capable":[55],"solving":[57],"NUM":[58,85],"problems":[59],"with":[60],"either":[61],"concave":[62],"or":[63],"nonconcave":[64],"function.":[66],"Although":[67],"presented":[69],"approach":[71],"originally":[73],"formulated":[74],"compute":[76],"upper":[77],"bounds":[78,96],"for":[79],"global":[81,103],"optima":[82],"problem,":[86],"we":[87],"illustrate":[88],"through":[89],"several":[90],"simulation":[91],"examples":[92],"that":[93],"obtained":[95],"correspond":[98],"problems\u2019":[101],"exact":[102],"optima.":[104]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}