{"id":"https://openalex.org/W3164941252","doi":"https://doi.org/10.1137/20m1369592","title":"Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling","display_name":"Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3164941252","doi":"https://doi.org/10.1137/20m1369592","mag":"3164941252"},"language":"en","primary_location":{"id":"doi:10.1137/20m1369592","is_oa":true,"landing_page_url":"https://doi.org/10.1137/20m1369592","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/20M1369592","source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/20M1369592","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070409272","display_name":"Daniel Brosch","orcid":"https://orcid.org/0000-0003-3988-4336"},"institutions":[{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"D. Brosch","raw_affiliation_strings":["Tilburg University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tilburg University,","institution_ids":["https://openalex.org/I193700539"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047819350","display_name":"Monique Laurent","orcid":"https://orcid.org/0000-0001-8474-2121"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"M. Laurent","raw_affiliation_strings":["Centrum Wiskunde & Informatica (CWI), Amsterdam, and Tilburg University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica (CWI), Amsterdam, and Tilburg University,","institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I193700539"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029014483","display_name":"Andries Steenkamp","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"A. Steenkamp","raw_affiliation_strings":["Centrum Wiskunde & Informatica (CWI), Amsterdam,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica (CWI), Amsterdam,","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4567,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67335524,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"31","issue":"3","first_page":"2227","last_page":"2254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.9958000183105469,"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/mathematics","display_name":"Mathematics","score":0.6207168102264404},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.46449828147888184},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4430038034915924},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.4427454471588135},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40268754959106445},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3689730763435364},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07736757397651672}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6207168102264404},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.46449828147888184},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4430038034915924},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4427454471588135},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40268754959106445},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3689730763435364},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07736757397651672},{"id":"https://openalex.org/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/20m1369592","is_oa":true,"landing_page_url":"https://doi.org/10.1137/20m1369592","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/20M1369592","source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:openaire/a8af7dc0-2796-44bd-8612-a5b7315f24cc","is_oa":true,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/a8af7dc0-2796-44bd-8612-a5b7315f24cc","pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Brosch, D, Laurent, M & Steenkamp, A 2021, 'Optimizing hypergraph-based polynomials modeling job-occupancy in queuing with redundancy scheduling', SIAM Journal on Optimization, vol. 31, no. 3, pp. 2227-2254. https://doi.org/10.1137/20M1369592","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2009.04510","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2009.04510","pdf_url":"https://arxiv.org/pdf/2009.04510","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:cwi.nl:31085","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/31085","pdf_url":"https://ir.cwi.nl/pub/31085/31085.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization vol. 31 no. 3, pp. 2227-2254","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:tilburguniversity.edu:publications/a8af7dc0-2796-44bd-8612-a5b7315f24cc","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2009.04510","pdf_url":null,"source":{"id":"https://openalex.org/S4406923027","display_name":"Tilburg University Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Brosch, D, Laurent, M & Steenkamp, A 2021, 'Optimizing hypergraph-based polynomials modeling job-occupancy in queuing with redundancy scheduling', SIAM Journal on Optimization, vol. 31, no. 3, pp. 2227-2254. https://doi.org/10.1137/20M1369592","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1137/20m1369592","is_oa":true,"landing_page_url":"https://doi.org/10.1137/20m1369592","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/20M1369592","source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.699999988079071}],"awards":[{"id":"https://openalex.org/G3374013012","display_name":null,"funder_award_id":"764759","funder_id":"https://openalex.org/F4320335254","funder_display_name":"Horizon 2020"},{"id":"https://openalex.org/G4535932799","display_name":null,"funder_award_id":"813211","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G5511553587","display_name":null,"funder_award_id":"764759","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"},{"id":"https://openalex.org/G6233398772","display_name":null,"funder_award_id":"813211","funder_id":"https://openalex.org/F4320335254","funder_display_name":"Horizon 2020"}],"funders":[{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320335254","display_name":"Horizon 2020","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3164941252.pdf","grobid_xml":"https://content.openalex.org/works/W3164941252.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W109405981","https://openalex.org/W1544013721","https://openalex.org/W1965094948","https://openalex.org/W1995891203","https://openalex.org/W2055993677","https://openalex.org/W2075605357","https://openalex.org/W2075804573","https://openalex.org/W2101520088","https://openalex.org/W2104385491","https://openalex.org/W2114189119","https://openalex.org/W2121547771","https://openalex.org/W2123109473","https://openalex.org/W2139517149","https://openalex.org/W2143920029","https://openalex.org/W2267943254","https://openalex.org/W2462681966","https://openalex.org/W2962948547","https://openalex.org/W2963105968","https://openalex.org/W3031118465","https://openalex.org/W3100496417","https://openalex.org/W3101839805","https://openalex.org/W3104971636","https://openalex.org/W4248232393"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1964872188","https://openalex.org/W2187391117","https://openalex.org/W1981809986","https://openalex.org/W2949367465","https://openalex.org/W2587048717","https://openalex.org/W4235203617","https://openalex.org/W2006359264","https://openalex.org/W3029201158","https://openalex.org/W4794847"],"abstract_inverted_index":{"We":[0],"investigate":[1],"two":[2],"classes":[3],"of":[4,13,23,25,84,113],"multivariate":[5],"polynomials":[6,28,86,115],"with":[7,38,54],"variables":[8],"indexed":[9],"by":[10,45],"the":[11,70,76,94,101,117],"edges":[12],"a":[14,90,109],"uniform":[15,77],"hypergraph":[16],"and":[17,48,97],"coefficients":[18],"depending":[19],"on":[20],"certain":[21],"patterns":[22],"unions":[24],"edges.":[26],"These":[27],"arise":[29],"naturally":[30],"to":[31,63],"model":[32],"job-occupancy":[33],"in":[34,51,106],"some":[35],"queuing":[36],"problems":[37],"redundancy":[39],"scheduling":[40],"policies.":[41],"The":[42],"question,":[43],"posed":[44],"Cardinaels,":[46],"Borst,":[47],"van":[49],"Leeuwaarden":[50],"[Redundancy":[52],"Scheduling":[53],"Locally":[55],"Stable":[56],"Compatibility":[57],"Graphs,":[58],"arXiv":[59],"preprint,":[60],"2020],":[61],"is":[62,73],"decide":[64],"whether":[65],"their":[66],"global":[67],"minimum":[68],"over":[69,116],"standard":[71],"simplex":[72],"attained":[74],"at":[75],"probability":[78],"distribution.":[79],"By":[80],"exploiting":[81],"symmetry":[82],"properties":[83],"these":[85,114],"we":[87,105],"can":[88],"give":[89],"positive":[91],"answer":[92],"for":[93,100],"first":[95],"class":[96],"partial":[98],"results":[99],"second":[102],"one,":[103],"where":[104],"fact":[107],"show":[108],"stronger":[110],"convexity":[111],"property":[112],"simplex.":[118]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2021-06-07T00:00:00"}