{"id":"https://openalex.org/W2101567631","doi":"https://doi.org/10.1109/wsc.2003.1261639","title":"Using simulation to approximate subgradients of convex performance measures in service systems","display_name":"Using simulation to approximate subgradients of convex performance measures in service systems","publication_year":2004,"publication_date":"2004-08-23","ids":{"openalex":"https://openalex.org/W2101567631","doi":"https://doi.org/10.1109/wsc.2003.1261639","mag":"2101567631"},"language":"en","primary_location":{"id":"doi:10.1109/wsc.2003.1261639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2003.1261639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693)","raw_type":"proceedings-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/A5067807304","display_name":"J\u00fal\u00edus Atlason","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Atlason","raw_affiliation_strings":["Department of Industral and Operations Engineering, University of Michigan, Ann Arbor, MI, USA","Dept. of Ind. & Oper. Eng., Michigan Univ., Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industral and Operations Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Dept. of Ind. & Oper. Eng., Michigan Univ., Ann Arbor, MI, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013764577","display_name":"Marina A. Epelman","orcid":"https://orcid.org/0000-0002-0056-1583"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.A. Epelman","raw_affiliation_strings":["Department of Industral and Operations Engineering, University of Michigan, Ann Arbor, MI, USA","Dept. of Ind. & Oper. Eng., Michigan Univ., Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industral and Operations Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Dept. of Ind. & Oper. Eng., Michigan Univ., Ann Arbor, MI, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075933702","display_name":"Shane G. Henderson","orcid":"https://orcid.org/0000-0003-1004-4034"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S.G. Henderson","raw_affiliation_strings":["School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, USA","Cornell University"],"affiliations":[{"raw_affiliation_string":"School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067807304"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":1.7485,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.85321784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1824","last_page":"1832"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/subgradient-method","display_name":"Subgradient method","score":0.9483639001846313},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6902414560317993},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5213507413864136},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5142857432365417},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.503208577632904},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48919156193733215},{"id":"https://openalex.org/keywords/quasiconvex-function","display_name":"Quasiconvex function","score":0.4841509461402893},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4830387532711029},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4577336609363556},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4564951956272125},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42589831352233887},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.3310618996620178}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9483639001846313},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6902414560317993},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5213507413864136},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5142857432365417},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.503208577632904},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48919156193733215},{"id":"https://openalex.org/C80278974","wikidata":"https://www.wikidata.org/wiki/Q1126412","display_name":"Quasiconvex function","level":5,"score":0.4841509461402893},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4830387532711029},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4577336609363556},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4564951956272125},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42589831352233887},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.3310618996620178},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wsc.2003.1261639","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2003.1261639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W389907844","https://openalex.org/W1523765121","https://openalex.org/W1593494339","https://openalex.org/W1983916623","https://openalex.org/W2089720209","https://openalex.org/W2103450593","https://openalex.org/W2118000334","https://openalex.org/W2122203560","https://openalex.org/W2136155717","https://openalex.org/W2147224235","https://openalex.org/W2155637385","https://openalex.org/W2181317554","https://openalex.org/W2503725246","https://openalex.org/W6635461498","https://openalex.org/W6675556321"],"related_works":["https://openalex.org/W3041201091","https://openalex.org/W2982993961","https://openalex.org/W4288087238","https://openalex.org/W4383227879","https://openalex.org/W4387134955","https://openalex.org/W3199344664","https://openalex.org/W2034688818","https://openalex.org/W3167336199","https://openalex.org/W2901800814","https://openalex.org/W2976503777"],"abstract_inverted_index":{"We":[0,108],"study":[1,112],"the":[2,31,55,67,89,104,115],"problem":[3,21,59],"of":[4,8,60,69,117],"approximating":[5,61,70],"a":[6,9,37,42,110],"subgradient":[7,47],"convex":[10],"(or":[11],"concave)":[12],"discrete":[13],"function":[14],"that":[15],"is":[16,63],"evaluated":[17],"via":[18,84],"simulation.":[19],"This":[20],"arises,":[22],"for":[23,81],"instance,":[24],"in":[25,36],"optimization":[26],"problems":[27],"such":[28],"as":[29],"finding":[30],"minimal":[32],"cost":[33],"staff":[34],"schedule":[35],"call":[38],"center":[39],"subject":[40],"to":[41,52,66,100,113],"service":[43],"level":[44],"constraint.":[45],"There,":[46],"information":[48],"can":[49,97],"be":[50,98],"used":[51],"significantly":[53],"reduce":[54],"search":[56],"space.":[57],"The":[58],"subgradients":[62,102],"closely":[64],"related":[65],"one":[68],"gradients":[71,83],"and":[72,75,93],"we":[73],"suggest":[74],"compare":[76],"how":[77],"three":[78],"existing":[79],"methods":[80],"computing":[82],"simulation,":[85],"i.e.,":[86],"finite":[87],"differences,":[88],"likelihood":[90],"ratio":[91],"method":[92],"infinitesimal":[94],"perturbation":[95],"analysis,":[96],"applied":[99],"approximate":[101],"when":[103],"variables":[105],"are":[106],"discrete.":[107],"provide":[109],"computational":[111],"highlight":[114],"properties":[116],"each":[118],"approach.":[119]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-02-25T21:11:00.739837","created_date":"2025-10-10T00:00:00"}