English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 47121/50987 (92%)
造訪人次 : 13819248      線上人數 : 247
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    主頁登入上傳說明關於CCUR管理 到手機版


    請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/3020


    題名: Using fuzzy numbers in knapsack problems
    作者: Lin FT
    Yao JS
    貢獻者: 應數系
    關鍵詞: fuzzy sets
    optimization
    knapsack problem
    multiconstraint 0/1 knapsack problem
    signed distance ranking
    日期: 2001
    上傳時間: 2009-12-11 12:07:55 (UTC+8)
    摘要: This paper investigates knapsack problems in which all of the weight coefficients are fuzzy numbers. This work is based on the assumption that each weight coefficient is imprecise due to the use of decimal truncation or rough estimation of the coefficients by the decision-maker. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve this problem. Our work intends to extend the original knapsack problem into a more generalized problem that would be useful in practical situations. As a result, our study shows that the fuzzy knapsack problem is an extension of the crisp knapsack problem, and that the crisp knapsack problem is a special case of the fuzzy knapsack problem. (C) 2001 Elsevier Science B.V. All rights reserved.
    關聯: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH Volume: 135 Issue: 1 Pages: 158-176
    顯示於類別:[應數系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbText508檢視/開啟


    在CCUR中所有的資料項目都受到原著作權保護.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋