发布求助
文献互助 智能选刊 最新文献

Central European Journal of Operations Research最新文献

筛选
英文 中文
Optimal model description of finance and human factor indices 财务和人力因素指数的最佳模型描述
IF 1.7 4区 管理学
Central European Journal of Operations Research Pub Date : 2024-01-08 DOI: 10.1007/s10100-023-00897-7
Betül Kalaycı, V. Purutçuoğlu, Gerhard-Wilhelm Weber
{"title":"Optimal model description of finance and human factor indices","authors":"Betül Kalaycı, V. Purutçuoğlu, Gerhard-Wilhelm Weber","doi":"10.1007/s10100-023-00897-7","DOIUrl":"https://doi.org/10.1007/s10100-023-00897-7","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"53 16","pages":""},"PeriodicalIF":1.7,"publicationDate":"2024-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139447323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modelling pandemic behavior with a network-SIRD approach 用网络-SIRD方法模拟流行病行为
IF 1.7 4区 管理学
Central European Journal of Operations Research Pub Date : 2023-12-11 DOI: 10.1007/s10100-023-00894-w
Mira Baude, Alf Kimms
{"title":"Modelling pandemic behavior with a network-SIRD approach","authors":"Mira Baude, Alf Kimms","doi":"10.1007/s10100-023-00894-w","DOIUrl":"https://doi.org/10.1007/s10100-023-00894-w","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"39 4","pages":""},"PeriodicalIF":1.7,"publicationDate":"2023-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138981695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Waste collection routing: a survey on problems and methods 垃圾收集路线：问题和方法调查
IF 1.7 4区 管理学
Central European Journal of Operations Research Pub Date : 2023-11-15 DOI: 10.1007/s10100-023-00892-y
Christina Hess, Alina G. Dragomir, K. Doerner, Daniele Vigo
{"title":"Waste collection routing: a survey on problems and methods","authors":"Christina Hess, Alina G. Dragomir, K. Doerner, Daniele Vigo","doi":"10.1007/s10100-023-00892-y","DOIUrl":"https://doi.org/10.1007/s10100-023-00892-y","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"47 1","pages":"1-36"},"PeriodicalIF":1.7,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139273354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel auto-pruned ensemble clustering via SOCP 一种新的基于SOCP的自动修剪集成聚类
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-10-29 DOI: 10.1007/s10100-023-00887-9
Duygu Üçüncü, Süreyya Akyüz, Erdal Gül
{"title":"A novel auto-pruned ensemble clustering via SOCP","authors":"Duygu Üçüncü, Süreyya Akyüz, Erdal Gül","doi":"10.1007/s10100-023-00887-9","DOIUrl":"https://doi.org/10.1007/s10100-023-00887-9","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136158026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
How Hartl exceeds Skiba: determinants of a successful career in academia 哈特尔如何超越斯基巴:学术生涯成功的决定因素
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-10-27 DOI: 10.1007/s10100-023-00889-7
Gustav Feichtinger, Dieter Grass, Peter M. Kort, Andreas J. Novak, Andrea Seidl, Stefan Wrzaczek
{"title":"How Hartl exceeds Skiba: determinants of a successful career in academia","authors":"Gustav Feichtinger, Dieter Grass, Peter M. Kort, Andreas J. Novak, Andrea Seidl, Stefan Wrzaczek","doi":"10.1007/s10100-023-00889-7","DOIUrl":"https://doi.org/10.1007/s10100-023-00889-7","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136317173","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Altruistic preferences in global emission games 全球排放博弈中的利他偏好
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-10-27 DOI: 10.1007/s10100-023-00890-0
A. Zapata, A. M. Mármol, L. Monroy, M. A. Caraballo
{"title":"Altruistic preferences in global emission games","authors":"A. Zapata, A. M. Mármol, L. Monroy, M. A. Caraballo","doi":"10.1007/s10100-023-00890-0","DOIUrl":"https://doi.org/10.1007/s10100-023-00890-0","url":null,"abstract":"Abstract This paper analyses the impact of altruism on the individual country goverments’ incentives to reduce global polluting emissions. The game theory perspective provides insights into the strategic decision-making processes of the governments regarding the problem of climate change. We propose a model of strategic interactions among countries in which each government is concerned with its own benefit, as well as with the benefits of all the other countries.The model is a vector-valued non-cooperative game that permits the representation of situations in which the preferences of the governments are incomplete and there is imprecision about the degrees of altruism. The focus is on the identification of the potential equilibria that will eventually be reached when the governments show different attitudes towards other countries or groups of countries. As a result, we show that the incorporation of altruism into the model produces equilibria with a positive effect on the reduction of emissions.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"228 1-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136261926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mixed integer linear programming formulation for K-means clustering problem k -均值聚类问题的混合整数线性规划公式
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-10-27 DOI: 10.1007/s10100-023-00881-1
Kolos Cs. Ágoston, Marianna E.-Nagy
{"title":"Mixed integer linear programming formulation for K-means clustering problem","authors":"Kolos Cs. Ágoston, Marianna E.-Nagy","doi":"10.1007/s10100-023-00881-1","DOIUrl":"https://doi.org/10.1007/s10100-023-00881-1","url":null,"abstract":"Abstract The minimum sum-of-squares clusering is the most widely used clustering method. The minimum sum-of-squares clustering is usually solved by the heuristic KMEANS algorithm, which converges to a local optimum. A lot of effort has been made to solve such kind of problems, but a mixed integer linear programming formulation (MILP) is still missing. In this paper, we formulate MILP models. The advantage of MILP formulation is that users can extend the original problem with arbitrary linear constraints. We also present numerical results, we solve these models up to sample size of 150.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136311460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A fast staffing algorithm for multistage call centers with impatient customers and time-dependent overflow 多阶段呼叫中心的快速人员配置算法，具有不耐烦的客户和时间依赖溢出
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-10-13 DOI: 10.1007/s10100-023-00883-z
Michael Manitz, Marc-Philip Piehl
{"title":"A fast staffing algorithm for multistage call centers with impatient customers and time-dependent overflow","authors":"Michael Manitz, Marc-Philip Piehl","doi":"10.1007/s10100-023-00883-z","DOIUrl":"https://doi.org/10.1007/s10100-023-00883-z","url":null,"abstract":"Abstract Ensuring customer satisfaction is one of the main objectives of a call center. We focus on the question of how many agents are necessary and how they should be allocated to maintain a service level threshold and reduce the expected waiting time of the customers. In this paper, we consider a multistage call center that consists of a front and a back office, impatient customers, and an overflow mechanism. Based on the performance evaluation of such a system using a continuous-time Markov chain, a configuration of agents is determined using a binary search algorithm. We focus on structural insights, e.g., convexity conditions, to obtain a quick solution for the staffing problem. Since monotonicity does not always hold, the approach is heuristic. The numerical results show the performance of the algorithm. The influence of the fraction requiring second-level service in the back office and the impatience rate for the minimum number of agents is shown.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135853081","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Solving the minimum-cost double Roman domination problem 求解最小代价双罗马统治问题
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-09-30 DOI: 10.1007/s10100-023-00884-y
Ana Klobučar Barišić, Robert Manger
{"title":"Solving the minimum-cost double Roman domination problem","authors":"Ana Klobučar Barišić, Robert Manger","doi":"10.1007/s10100-023-00884-y","DOIUrl":"https://doi.org/10.1007/s10100-023-00884-y","url":null,"abstract":"","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136341455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-day fair collaboration in demand-responsive transportation 多日公平合作的需求响应运输
4区 管理学
Central European Journal of Operations Research Pub Date : 2023-09-28 DOI: 10.1007/s10100-023-00882-0
E. Angelelli, V. Morandi, M. G. Speranza
{"title":"Multi-day fair collaboration in demand-responsive transportation","authors":"E. Angelelli, V. Morandi, M. G. Speranza","doi":"10.1007/s10100-023-00882-0","DOIUrl":"https://doi.org/10.1007/s10100-023-00882-0","url":null,"abstract":"Abstract In this paper, we consider the case of companies that offer a demand-responsive transportation service, such as a shared-taxi service, and are engaged in a horizontal collaboration initiative. The goal of the coalition is to optimize the transportation operations in such a way that no company is penalized, in terms of customers served and/or working time. We present an optimization model for a multi-day planning horizon that includes constraints aimed at guaranteeing a level of fairness to all companies that can be controlled over the planning horizon and day-by-day, if beneficial. An adaptive large neighborhood search heuristic is then presented for its solution. The computational experiments show that, although the model constraints the optimization space, it still guarantees substantial savings. Moreover, they show that the model is flexible and can guarantee the sustainability in the long term of the collaboration initiative.","PeriodicalId":9689,"journal":{"name":"Central European Journal of Operations Research","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135387277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信