{"id":"https://openalex.org/W4413640506","doi":"https://doi.org/10.23919/wiopt66569.2025.11123286","title":"Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost","display_name":"Capacity Provisioning Motivated Online Non-Convex Optimization Problem with Memory and Switching Cost","publication_year":2025,"publication_date":"2025-05-26","ids":{"openalex":"https://openalex.org/W4413640506","doi":"https://doi.org/10.23919/wiopt66569.2025.11123286"},"language":"en","primary_location":{"id":"doi:10.23919/wiopt66569.2025.11123286","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt66569.2025.11123286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 23rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5034942102","display_name":"Rahul Vaze","orcid":"https://orcid.org/0000-0002-9712-1110"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rahul Vaze","raw_affiliation_strings":["xx"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"xx","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037150671","display_name":"Jayakrishnan Nair","orcid":"https://orcid.org/0000-0002-3849-8858"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jayakrishnan Nair","raw_affiliation_strings":["xx"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"xx","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24247827,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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.9980999827384949,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.982699990272522,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9750000238418579,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/provisioning","display_name":"Provisioning","score":0.7042391896247864},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6028856635093689},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4496321678161621},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4336240291595459},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.39007508754730225},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24414560198783875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1601138412952423}],"concepts":[{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.7042391896247864},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6028856635093689},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4496321678161621},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4336240291595459},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.39007508754730225},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24414560198783875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1601138412952423},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/wiopt66569.2025.11123286","is_oa":false,"landing_page_url":"https://doi.org/10.23919/wiopt66569.2025.11123286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 23rd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2033878896","https://openalex.org/W2048847002","https://openalex.org/W2128085284","https://openalex.org/W2809197406","https://openalex.org/W2887376719","https://openalex.org/W4240518003","https://openalex.org/W4322762559","https://openalex.org/W4392092121","https://openalex.org/W4396703341"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2893779165","https://openalex.org/W2017432143","https://openalex.org/W1973694374","https://openalex.org/W2983574358","https://openalex.org/W2370475531","https://openalex.org/W4385924768","https://openalex.org/W4256551238"],"abstract_inverted_index":{"An":[0],"online":[1,64],"non-convex":[2,77],"optimization":[3,66],"problem":[4,68],"is":[5,10,76],"considered":[6,75],"where":[7],"the":[8,13,25,38,62,72,93,101],"goal":[9],"to":[11,61],"minimize":[12],"flow":[14],"time":[15],"(total":[16],"delay)":[17],"of":[18,21,27,40],"a":[19,32],"set":[20],"jobs":[22],"by":[23,50],"modulating":[24],"number":[26,39],"active":[28,41],"servers,":[29],"but":[30],"with":[31,36,69],"switching":[33,70],"cost":[34],"associated":[35],"changing":[37],"servers":[42],"over":[43],"time.":[44,59],"Each":[45],"job":[46],"can":[47],"be":[48],"processed":[49],"at":[51,57,81],"most":[52],"one":[53],"fixed":[54],"speed":[55],"server":[56],"any":[58],"Compared":[60],"usual":[63],"convex":[65],"(OCO)":[67],"cost,":[71],"objective":[73],"function":[74],"and":[78,90],"more":[79],"importantly,":[80],"each":[82],"time,":[83],"it":[84],"depends":[85],"on":[86],"all":[87],"past":[88],"decisions":[89],"not":[91],"just":[92],"present":[94],"one.":[95],"Competitive":[96],"algorithms":[97],"are":[98],"derived":[99],"for":[100],"worst-case":[102],"inputs.":[103]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}