Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2023
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2023
License: CC BY
Data sources: ZENODO
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Article . 2023
License: CC BY
Data sources: Datacite
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Neutrosophic Sets and Systems
Article . 2023
Data sources: DOAJ
versions View all 3 versions
addClaim

Optimal Neutrosophic Assignment and the Hungarian Method

Authors: Maissam Jdid; Florentin Smarandache;

Optimal Neutrosophic Assignment and the Hungarian Method

Abstract

Operations research methods focus on formulating decision models, models that approximate the real work environment to mathematical models, and their optimal solution helps the decision maker to make optimal decisions that guarantee the greatest profit or the lowest cost. These models were built based on the data collected on the practical issue under study, and these data are classic values, specific values that are correct and accurate during the period in which these data are collected, which means that they remain ideal if the surrounding conditions remain the same as those in which they were collected. Data, and since the aim of this study is to make ideal decisions and to develop future plans through which we achieve the greatest profit or the least cost, It was necessary to search for a study that fits all the conditions in which the work environment passes in the present and the future. If we take data, neural values, indeterminate values - uncertain - leave nothing to chance, and take into account all conditions from worst to best. In this paper, we will present a complementary study to what we have done in previous research, the purpose of which was to reformulate some operational research methods using neutrosophic data. We will reformulate the assignment problem and one of the methods for its solution, which is the Hungarian method, using neutrosophic concepts, and we will explain the difference between using classical and neutrosophic data through examples

Related Organizations
Keywords

Electronic computers. Computer science, QA1-939, The optimal assignment problem - The Neutrosophic optimal assignment problem - The Hungarian method for solving assignment problems - linear models - Neutrosophic logic, optimal assignment problem, QA75.5-76.95, linear models, neutrosophic logic, hungarian method, Mathematics, The optimal assignment problem - The Neutrosophic optimal assignment problem - The Hungarian method for solving assignment problems - linear models - Neutrosophic logic

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
    OpenAIRE UsageCounts
    Usage byUsageCounts
    visibility views 18
    download downloads 16
  • 18
    views
    16
    downloads
    Powered byOpenAIRE UsageCounts
Powered by OpenAIRE graph
Found an issue? Give us feedback
visibility
download
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
views
OpenAIRE UsageCountsViews provided by UsageCounts
downloads
OpenAIRE UsageCountsDownloads provided by UsageCounts
0
Average
Average
Average
18
16
Green
gold
Related to Research communities