Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043.00272130
Flávio Henrique Batista de Souza, Marcos Henrique Gonçalves Abreu, Paulo Ricardo Fonseca Trindade, Gustavo Alves Fernandes, Luiz Melk de Carvalho, Braulio Roberto Gomes Marinho Couto, Diva de Souza e Silva Rodrigues
The problem of finding the shortest path between a source and a destination node, commonly represented by graphs, has several computational algorithms as an attempt to find what is called the minimum path. Depending on the number of nodes in-between the source and destination, the process of finding the shortest path can demand a high computational cost (with polynomial complexity). A solution to reduce the computational cost is the use of the concept of parallelism, which divides the algorithm tasks between the processing cores. This article presents a comparative analysis of the main algorithms of the shortest path class: Dijkstra, Bellman-Ford, Floyd-Warshall and Johnson. The performance of each algorithm was evaluated considering different parallelization approaches and they were applied on general and open-pit mining databases present in the literature. The experimental results showed an improvement in performance of about 55% on the execution time depending on the chosen parallelization point.
{"title":"PARALLELIZATION OF SHORTEST PATH CLASS ALGORITHMS: A COMPARATIVE ANALYSIS","authors":"Flávio Henrique Batista de Souza, Marcos Henrique Gonçalves Abreu, Paulo Ricardo Fonseca Trindade, Gustavo Alves Fernandes, Luiz Melk de Carvalho, Braulio Roberto Gomes Marinho Couto, Diva de Souza e Silva Rodrigues","doi":"10.1590/0101-7438.2023.043.00272130","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00272130","url":null,"abstract":"The problem of finding the shortest path between a source and a destination node, commonly represented by graphs, has several computational algorithms as an attempt to find what is called the minimum path. Depending on the number of nodes in-between the source and destination, the process of finding the shortest path can demand a high computational cost (with polynomial complexity). A solution to reduce the computational cost is the use of the concept of parallelism, which divides the algorithm tasks between the processing cores. This article presents a comparative analysis of the main algorithms of the shortest path class: Dijkstra, Bellman-Ford, Floyd-Warshall and Johnson. The performance of each algorithm was evaluated considering different parallelization approaches and they were applied on general and open-pit mining databases present in the literature. The experimental results showed an improvement in performance of about 55% on the execution time depending on the chosen parallelization point.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135658939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043.00272982
Vishal Gupta, Pooja Dhawan, Jonty Jindal, Manu Verma
In the present article, some fixed point theorems are investigated for two pairs of weakly compatible maps through (Ω, ∆)-type weak contractive maps in the framework of fuzzy metric spaces. The results studied in this workpiece are generalizations of some recent results existing in literature. Also, some illustrative examples are presented in last section to check the authenticity of our results.
{"title":"SOME NOVEL FIXED POINT RESULTS FOR (Ω, ∆)-WEAK CONTRACTION CONDITION IN COMPLETE FUZZY METRIC SPACES","authors":"Vishal Gupta, Pooja Dhawan, Jonty Jindal, Manu Verma","doi":"10.1590/0101-7438.2023.043.00272982","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00272982","url":null,"abstract":"In the present article, some fixed point theorems are investigated for two pairs of weakly compatible maps through (Ω, ∆)-type weak contractive maps in the framework of fuzzy metric spaces. The results studied in this workpiece are generalizations of some recent results existing in literature. Also, some illustrative examples are presented in last section to check the authenticity of our results.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136202392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043.00275468
Renato Silva de Melo, André Luís Vignatti, Flávio Keidi Miyazawa, Matheus Jun Ota
The Least Cost Influence Problem is a combinatorial optimization problem that appears in the context of social networks. The objective is to give incentives to individuals of a network, such that some information spreads to a desired fraction of the network at minimum cost. We introduce a problem-dependent algorithm in a branch-and-bound scheme to compute a dual bound for this problem. The idea is to exploit the connectivity properties of sub-graphs of the input graph associated with each node of the branch-and-bound tree and use it to increase each sub-problem’s lower bound. Our algorithm works well and finds a lower bound tighter than the LP-relaxation in linear time in the size of the graph. Computational experiments with synthetic graphs and real-world social networks show improvements in using our proposed bounds. The improvements are gains in running time or gap reduction for exact solutions to the problem.
{"title":"COMBINATORIAL DUAL BOUNDS ON THE LEAST COST INFLUENCE PROBLEM","authors":"Renato Silva de Melo, André Luís Vignatti, Flávio Keidi Miyazawa, Matheus Jun Ota","doi":"10.1590/0101-7438.2023.043.00275468","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00275468","url":null,"abstract":"The Least Cost Influence Problem is a combinatorial optimization problem that appears in the context of social networks. The objective is to give incentives to individuals of a network, such that some information spreads to a desired fraction of the network at minimum cost. We introduce a problem-dependent algorithm in a branch-and-bound scheme to compute a dual bound for this problem. The idea is to exploit the connectivity properties of sub-graphs of the input graph associated with each node of the branch-and-bound tree and use it to increase each sub-problem’s lower bound. Our algorithm works well and finds a lower bound tighter than the LP-relaxation in linear time in the size of the graph. Computational experiments with synthetic graphs and real-world social networks show improvements in using our proposed bounds. The improvements are gains in running time or gap reduction for exact solutions to the problem.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135658867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043.00268255
S. L. Gonzaga de Oliveira
This paper studies the bandwidth reduction problem for large-scale sparse matrices in serial computations. A heuristic for bandwidth reduction reorders the rows and columns of a given sparse matrix, placing entries with a non-null value as close to the main diagonal as possible. Recently, a paper proposed the FNCHC+ heuristic. The heuristic method is a variant of the Fast Node Centroid Hill-Climbing algorithm. The FNCHC+ heuristic presented better results than the other existing heuristics in the literature when applied to reduce the bandwidth of large-scale graphs (of the underline matrices) with sizes up to 18.6 million vertices and up to 57.2 million edges. The present paper provides new experiments with even larger graphs. Specifically, the present study performs experiments with test problems containing up to 24 million vertices and 130 million edges. The results confirm that the FNCHC+ algorithm is the state-of-the-art metaheuristic algorithm for reducing the bandwidth of large-scale matrices.
{"title":"AN EVALUATION OF HEURISTIC METHODS FOR THE BANDWIDTH REDUCTION OF LARGE-SCALE GRAPHS","authors":"S. L. Gonzaga de Oliveira","doi":"10.1590/0101-7438.2023.043.00268255","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00268255","url":null,"abstract":"This paper studies the bandwidth reduction problem for large-scale sparse matrices in serial computations. A heuristic for bandwidth reduction reorders the rows and columns of a given sparse matrix, placing entries with a non-null value as close to the main diagonal as possible. Recently, a paper proposed the FNCHC+ heuristic. The heuristic method is a variant of the Fast Node Centroid Hill-Climbing algorithm. The FNCHC+ heuristic presented better results than the other existing heuristics in the literature when applied to reduce the bandwidth of large-scale graphs (of the underline matrices) with sizes up to 18.6 million vertices and up to 57.2 million edges. The present paper provides new experiments with even larger graphs. Specifically, the present study performs experiments with test problems containing up to 24 million vertices and 130 million edges. The results confirm that the FNCHC+ algorithm is the state-of-the-art metaheuristic algorithm for reducing the bandwidth of large-scale matrices.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135658955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043spe1.00264750
V. B. Schramm, A. Damasceno, F. Schramm
. The goal of this study is to propose a decision model for supporting the choice of the best-agile model, based on the Flexible and Interactive Tradeoff (FITradeoff) method. This study provides the definition of an extensive set of 38 measurable criteria that were considered for evaluation of the most popular agile process models used in small and medium-scale enterprises. To illustrate the application of the model, we applied it to a set of alternatives that includes DSDM, SCRUM, XP2 and Crystal and an experienced project manager acted as our decision maker during the interactive elicitation process of the FITradeoff. The results show that the FITradeoff is very valuable for this class of problem because of its strong mathematical foundation and the possibility of combining two different ways for modeling the preferences of decision makers, which makes the process cognitively easier than other multi-criteria methods and increase the confidence on the results. Although our study focuses on the context of small and medium-scale companies for software development, the approach can be used to other types of environments, including distributed software development and large enterprises.
{"title":"SUPPORTING THE CHOICE OF THE BEST-FIT AGILE MODEL USING FITRADEOFF","authors":"V. B. Schramm, A. Damasceno, F. Schramm","doi":"10.1590/0101-7438.2023.043spe1.00264750","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043spe1.00264750","url":null,"abstract":". The goal of this study is to propose a decision model for supporting the choice of the best-agile model, based on the Flexible and Interactive Tradeoff (FITradeoff) method. This study provides the definition of an extensive set of 38 measurable criteria that were considered for evaluation of the most popular agile process models used in small and medium-scale enterprises. To illustrate the application of the model, we applied it to a set of alternatives that includes DSDM, SCRUM, XP2 and Crystal and an experienced project manager acted as our decision maker during the interactive elicitation process of the FITradeoff. The results show that the FITradeoff is very valuable for this class of problem because of its strong mathematical foundation and the possibility of combining two different ways for modeling the preferences of decision makers, which makes the process cognitively easier than other multi-criteria methods and increase the confidence on the results. Although our study focuses on the context of small and medium-scale companies for software development, the approach can be used to other types of environments, including distributed software development and large enterprises.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67471050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043.00267691
L. Vitorino, C. F. S. Gomes, F. Silva, M. Santos, S. F. Lucas
Processes that establish Compliance at first do not seem to add to the value chain of companies. However, the need to address legislation or issues related to corporate governance, social management, and the environment, lead large corporations to adopt such processes. This article aimed to establish a plan for prioritizing the implementation of compliance processes in an electric power generation company, through the method Value-Focused Thinking (VFT) of structuring problems, and the application of the new hybrid multicriteria method SAPEVO-WASPAS-2N, derived from the unprecedented junction of SAPEVO-M (Simple Aggregation of Preferences Expressed by Ordinal Vectors - Multi Decision Makers) and WASPAS-2N (Weighted Aggregated Sum Product Assessment) with two standardization techniques. The application of the hybrid model SAPEVO-WASPAS-2N proved to be consistent and robust, generating two possibilities of ordering priorities aligned with the strategic situation of the organization based on the criteria established through the opinion of the decision makers.
{"title":"PROPOSAL OF A NEW MULTI-CRITERIA METHODOLOGY SAPEVO-WASPAS-2N APPLIED IN PRIORITIZING THE IMPLEMENTATION OF COMPLIANCE PROCESSES","authors":"L. Vitorino, C. F. S. Gomes, F. Silva, M. Santos, S. F. Lucas","doi":"10.1590/0101-7438.2023.043.00267691","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043.00267691","url":null,"abstract":"Processes that establish Compliance at first do not seem to add to the value chain of companies. However, the need to address legislation or issues related to corporate governance, social management, and the environment, lead large corporations to adopt such processes. This article aimed to establish a plan for prioritizing the implementation of compliance processes in an electric power generation company, through the method Value-Focused Thinking (VFT) of structuring problems, and the application of the new hybrid multicriteria method SAPEVO-WASPAS-2N, derived from the unprecedented junction of SAPEVO-M (Simple Aggregation of Preferences Expressed by Ordinal Vectors - Multi Decision Makers) and WASPAS-2N (Weighted Aggregated Sum Product Assessment) with two standardization techniques. The application of the hybrid model SAPEVO-WASPAS-2N proved to be consistent and robust, generating two possibilities of ordering priorities aligned with the strategic situation of the organization based on the criteria established through the opinion of the decision makers.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136203385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043spe1.00263440
Rayara Sirlei Mauricio de Oliveira, D. Morais, J. Siebert
. Mobility and urban planning are challenging tasks for public authorities, especially in densely populated cities. The city of Olinda, Pernambuco-Brazil, faces problems in traffic and access to places, making it necessary to identify new alternatives to improve urban mobility in Olinda. This study presents a decision support model to develop and evaluate new alternatives to do so. In the decision frontend, Value-Focused Thinking was applied to identify objectives and their respective attributes, and to create alternatives based on these objectives. As a result, 69 alternatives were generated, concatenated into 48, and categorized into four groups. Group 1 and Group 2 comprise 30 alternatives that serve the city’s north side; however, they attend to the neighborhoods separately. Group 3 comprises 11 alternatives routes that serve the two areas together, this being the focus of this study, and Group four consists of 7 short-term alternatives. In the decision backend, the FITradeoff for ranking problematic method was applied to evaluate the 11 alternatives of Group 3. The study showed that it would be possible to improve mobility more urgently by making a few improvements to the itinerary on the existing routes. Therefore, the study discusses the possibility of starting to make progress in the urban system of the city by using fewer complex alternatives compared to setting up new routes.
{"title":"DEVELOPING AND EVALUATING NEW ALTERNATIVES FOR URBAN MOBILITY: A CASE STUDY OF A BRAZILIAN CITY","authors":"Rayara Sirlei Mauricio de Oliveira, D. Morais, J. Siebert","doi":"10.1590/0101-7438.2023.043spe1.00263440","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043spe1.00263440","url":null,"abstract":". Mobility and urban planning are challenging tasks for public authorities, especially in densely populated cities. The city of Olinda, Pernambuco-Brazil, faces problems in traffic and access to places, making it necessary to identify new alternatives to improve urban mobility in Olinda. This study presents a decision support model to develop and evaluate new alternatives to do so. In the decision frontend, Value-Focused Thinking was applied to identify objectives and their respective attributes, and to create alternatives based on these objectives. As a result, 69 alternatives were generated, concatenated into 48, and categorized into four groups. Group 1 and Group 2 comprise 30 alternatives that serve the city’s north side; however, they attend to the neighborhoods separately. Group 3 comprises 11 alternatives routes that serve the two areas together, this being the focus of this study, and Group four consists of 7 short-term alternatives. In the decision backend, the FITradeoff for ranking problematic method was applied to evaluate the 11 alternatives of Group 3. The study showed that it would be possible to improve mobility more urgently by making a few improvements to the itinerary on the existing routes. Therefore, the study discusses the possibility of starting to make progress in the urban system of the city by using fewer complex alternatives compared to setting up new routes.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67470118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043spe1.00263696
José Francisco Zanazzi, José Luis Zanazzi, Daniel Pontelli
{"title":"PRIORITIZATION OF IMPROVEMENT ACTIONS IN INDUSTRIAL PRODUCTION: APPLICATION OF THE FITRADEOFF METHOD TO ORDER IMPROVEMENT ACTIONS IDENTIFIED THROUGH THE FAILURES MODES AND EFFECTS ANALYSIS (FMEA)","authors":"José Francisco Zanazzi, José Luis Zanazzi, Daniel Pontelli","doi":"10.1590/0101-7438.2023.043spe1.00263696","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043spe1.00263696","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67470992","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043spe1.00263528
Sinndy Dayana Rico Lugo, Bingxin Du, J. Almeida, N. Nishino
{"title":"A CIRCULAR FOOD ECONOMY MULTICRITERIA DECISION PROBLEM BASED ON THE FITRADEOFF METHOD","authors":"Sinndy Dayana Rico Lugo, Bingxin Du, J. Almeida, N. Nishino","doi":"10.1590/0101-7438.2023.043spe1.00263528","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043spe1.00263528","url":null,"abstract":"","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67470245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1590/0101-7438.2023.043spe1.00258518
Jenny Milena Moreno Rodríguez, E. A. Frej, Takanni Hannaka Abreu Kang, Adiel Teixeira de Almeida
. Since most of the studies about outsourcing are focused on mathematical models, this paper seeks to support from theoretical bases the use of partial information to ease the decision-making process; the practical contribution is to apply the FITradeoff method for solving a multicriteria problem of an agricultural research company that seeks to decide about the need to outsource the operation in case to overhead the limited capacity of the analysis services. After the FITradeoff method was applied to elicit preferences from each decision-maker (DM), the results show whether or not it would be feasible to outsource a given service, and what the most promising options are. The method required the DMs to answer in less time only a few questions, which avoided placing an unnecessary cognitive burden on them and proved to be useful in assisting DMs in the decision-making.
{"title":"OUTSOURCING LABORATORY SERVICES FROM A COLOMBIAN AGRICULTURAL RESEARCH COMPANY USING THE FITRADEOFF METHOD UNDER MULTIPLE STAKEHOLDERS ANALYSIS","authors":"Jenny Milena Moreno Rodríguez, E. A. Frej, Takanni Hannaka Abreu Kang, Adiel Teixeira de Almeida","doi":"10.1590/0101-7438.2023.043spe1.00258518","DOIUrl":"https://doi.org/10.1590/0101-7438.2023.043spe1.00258518","url":null,"abstract":". Since most of the studies about outsourcing are focused on mathematical models, this paper seeks to support from theoretical bases the use of partial information to ease the decision-making process; the practical contribution is to apply the FITradeoff method for solving a multicriteria problem of an agricultural research company that seeks to decide about the need to outsource the operation in case to overhead the limited capacity of the analysis services. After the FITradeoff method was applied to elicit preferences from each decision-maker (DM), the results show whether or not it would be feasible to outsource a given service, and what the most promising options are. The method required the DMs to answer in less time only a few questions, which avoided placing an unnecessary cognitive burden on them and proved to be useful in assisting DMs in the decision-making.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67470441","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：