×

 

Suggest this Article to:

TOP INDEXERS
×

 

Suggest this Article to:

TOP ACADEMIC SEARCH ENGINES
×

 

Suggest this Article to:

TO 84 SEARCH ENGINES
  1. Google
  2. Bing
  3. Gigablast Search Index
  4. Scrubtheweb Directory
  5. Million Short
  6. Free Web Submission
  7. whatUseek
  8. Exact Seek
  9. Library of Congress
  10. Archives Hub
  11. National Archives
  12. arXiv e-Print Archive
  13. Archivenet
  14. NASA Historical Archive
  15. National Agricultural Library
  16. Smithsonian Institution Research Information System
  17. The British Library Catalogues & Collections
  18. CIA World Factbook
  19. State Legislative Websites Directory
  20. OpenDOAR
  21. Catalog of U.S. Government Publications
  22. Library of Congress
  23. Archives Hub
  24. National Archives
  25. arXiv e-Print Archive
  26. Archivenet
  27. NASA Historical Archive
  28. National Agricultural Library
  29. Smithsonian Institution Research Information System
  30. The British Library Catalogues & Collections
  31. CIA World Factbook
  32. State Legislative Websites Directory
  33. OpenDOAR
  34. Catalog of U.S. Government Publications
  35. Library of Congress
  36. Archives Hub
  37. National Archives
  38. arXiv e-Print Archive
  39. Archivenet
  40. NASA Historical Archive
  41. National Agricultural Library
  42. Smithsonian Institution Research Information System
  43. The British Library Catalogues & Collections
  44. CIA World Factbook
  45. State Legislative Websites Directory
  46. OpenDOAR
  47. Catalog of U.S. Government Publications
  48. Library of Congress
  49. Archives Hub
  50. National Archives
  51. arXiv e-Print Archive
  52. Archivenet
  53. NASA Historical Archive
  54. National Agricultural Library
  55. Smithsonian Institution Research Information System
  56. The British Library Catalogues & Collections
  57. CIA World Factbook
  58. State Legislative Websites Directory
  59. OpenDOAR
  60. Catalog of U.S. Government Publications
  61. Library of Congress
  62. Archives Hub
  63. National Archives
  64. arXiv e-Print Archive
  65. Archivenet
  66. NASA Historical Archive
  67. National Agricultural Library
  68. Smithsonian Institution Research Information System
  69. The British Library Catalogues & Collections
  70. CIA World Factbook
  71. State Legislative Websites Directory
  72. OpenDOAR
  73. Catalog of U.S. Government Publications
  74. CIA World Factbook
  75. State Legislative Websites Directory
  76. OpenDOAR
  77. Catalog of U.S. Government Publications
  78. Catalog of U.S. Government Publications


Public Article
  • verified
     

    Comment (2) on Soft Set Theory and uni-int Decision Making [European Journal of Operational Research, (2010) 207, 848-...

     
     
         
    ISSN: 2149 - 1402

    Publisher: author   

Comment (2) on Soft Set Theory and uni-int Decision Making [European Journal of Operational Research, (2010) 207, 848-...
Indexed in Science General
ARTICLE-FACTOR
 1.3
Article Basics Score: 3
Article Transparency Score: 2
Article Operation Score: 3
Article Articles Score: 3
Article Accessibility Score: 3
Article Problems
Under Evaluation
article Flaws Reduces Credit

SUBMIT PAPER ASK QUESTION
International Category Code (ICC):
ICC-1402
Publisher: Journal Of New Theory Naim Çağman
Authors: Serdar ENGÄ°NOÄžLU, Samet MemiÅŸ, Burak Arslan
International Journal Address (IAA):
IAA.ZONE/214976931402
eISSN : 2149 - 1402 VALID ISSN Validator
Abstract The uni-int decision-making method, which selects a set of optimum elements from the alternatives, was defined by Çağman and Enginoğlu via soft sets and their soft products. Lately, this method constructed by and-product/or-product has been configured by Enginoğlu and Memiş via fuzzy parameterized fuzzy soft matrices (fpfs-matrices), faithfully to the original, because a more general form is needed for the method in the event that the parameters or objects have uncertainties. In this study, we configure the method via fpfs-matrices and andnot-product/ornot-product, faithfully to the original. However, in the case that a large amount of data is processed, the method still has a disadvantage regarding time and complexity. To deal with this problem and to be able to use this configured method effectively denoted by CE10, we suggest two new algorithms in this paper, i.e. EMA18an and EMA18on, and prove that CE10 constructed by andnot-...
Article Basics


Article Title Basics
Details


Article ISSN Validity | VALID ISSN
Details


Article Basic Information
Details


Article Editorial Team Basics
Details


Article Archive and Articles Basics
Details




 

Basics

 

Contact and Support

 

For authors

 

Legal

Home

About

Evaluation

Contact Us

Linkedin

Facebook Twitter

Guide for authors

indexarticle

ISSN Checker

Terms & Conditions

Privacy Policy

ISBN CHECKER