IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v135y2001i1p158-176.html
   My bibliography  Save this article

Using fuzzy numbers in knapsack problems

Author

Listed:
  • Lin, Feng-Tse
  • Yao, Jing-Shing

Abstract

No abstract is available for this item.

Suggested Citation

  • Lin, Feng-Tse & Yao, Jing-Shing, 2001. "Using fuzzy numbers in knapsack problems," European Journal of Operational Research, Elsevier, vol. 135(1), pages 158-176, November.
    • Handle: RePEc:eee:ejores:v:135:y:2001:i:1:p:158-176
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00310-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Freville, A. & Plateau, G., 1986. "Heuristics and reduction methods for multiple constraints 0-1 linear programming problems," European Journal of Operational Research, Elsevier, vol. 24(2), pages 206-215, February.
    2. Magazine, M. J. & Oguz, Osman, 1984. "A heuristic algorithm for the multidimensional zero-one knapsack problem," European Journal of Operational Research, Elsevier, vol. 16(3), pages 319-326, June.
    3. Shizuo Senju & Yoshiaki Toyoda, 1968. "An Approach to Linear Programming with 0-1 Variables," Management Science, INFORMS, vol. 15(4), pages 196-207, December.
    4. Pisinger, David, 1995. "An expanding-core algorithm for the exact 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 175-187, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lin, Feng-Tse, 2008. "Solving the knapsack problem with imprecise weight coefficients using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 185(1), pages 133-145, February.
    2. Schäfer, Luca E. & Dietz, Tobias & Barbati, Maria & Figueira, José Rui & Greco, Salvatore & Ruzika, Stefan, 2021. "The binary knapsack problem with qualitative levels," European Journal of Operational Research, Elsevier, vol. 289(2), pages 508-514.
    3. Madjid Tavana & Kaveh Khalili-Damghani & Amir-Reza Abtahi, 2013. "A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm," Annals of Operations Research, Springer, vol. 206(1), pages 449-483, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    2. Arnaud Fréville & SaÏd Hanafi, 2005. "The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects," Annals of Operations Research, Springer, vol. 139(1), pages 195-227, October.
    3. Dimitris Bertsimas & Ramazan Demir, 2002. "An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems," Management Science, INFORMS, vol. 48(4), pages 550-565, April.
    4. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    5. Jakob Puchinger & Günther R. Raidl & Ulrich Pferschy, 2010. "The Multidimensional Knapsack Problem: Structure and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 250-265, May.
    6. Yalçın Akçay & Haijun Li & Susan Xu, 2007. "Greedy algorithm for the general multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 150(1), pages 17-29, March.
    7. Yalçin Akçay & Susan H. Xu, 2004. "Joint Inventory Replenishment and Component Allocation Optimization in an Assemble-to-Order System," Management Science, INFORMS, vol. 50(1), pages 99-116, January.
    8. Lin, Feng-Tse, 2008. "Solving the knapsack problem with imprecise weight coefficients using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 185(1), pages 133-145, February.
    9. Balev, Stefan & Yanev, Nicola & Freville, Arnaud & Andonov, Rumen, 2008. "A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 63-76, April.
    10. Ivan Derpich & Carlos Herrera & Felipe Sepúlveda & Hugo Ubilla, 2021. "Complexity indices for the multidimensional knapsack problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 589-609, June.
    11. Martello, Silvano & Pisinger, David & Toth, Paolo, 2000. "New trends in exact algorithms for the 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 123(2), pages 325-332, June.
    12. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    13. Yanhong Feng & Xu Yu & Gai-Ge Wang, 2019. "A Novel Monarch Butterfly Optimization with Global Position Updating Operator for Large-Scale 0-1 Knapsack Problems," Mathematics, MDPI, vol. 7(11), pages 1-31, November.
    14. Louis Anthony (Tony) Cox, Jr., 2012. "Evaluating and Improving Risk Formulas for Allocating Limited Budgets to Expensive Risk‐Reduction Opportunities," Risk Analysis, John Wiley & Sons, vol. 32(7), pages 1244-1252, July.
    15. Ghosh, Diptesh & Bandyopadhyay, Tathagata, 2006. "Spotting Difficult Weakly Correlated Binary Knapsack Problems," IIMA Working Papers WP2006-01-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    16. Cemal AKTÜRK & Sevinç GÜLSEÇEN, 2018. "Sipariş Teslim Tarihi Problemi İçin Çok Kriterli ve Çok Yöntemli Karar Destek Sistemi Önerisi," Istanbul Management Journal, Istanbul University Business School, vol. 29(84), pages 65-78, June.
    17. Saïd Hanafi & Christophe Wilbaut, 2011. "Improved convergent heuristics for the 0-1 multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 183(1), pages 125-142, March.
    18. Yamada, Takeo & Takeoka, Takahiro, 2009. "An exact algorithm for the fixed-charge multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 192(2), pages 700-705, January.
    19. G. Edward Fox & Christopher J. Nachtsheim, 1990. "An analysis of six greedy selection rules on a class of zero‐one integer programming models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 299-307, April.
    20. Wishon, Christopher & Villalobos, J. Rene, 2016. "Robust efficiency measures for linear knapsack problem variants," European Journal of Operational Research, Elsevier, vol. 254(2), pages 398-409.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:135:y:2001:i:1:p:158-176. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.