IDEAS home Printed from https://ideas.repec.org/p/ota/busdis/10252-910.html
   My bibliography  Save this paper

Comments on knapsack problems with a penalty

Author

Listed:
  • Iida, Hiroshi

Abstract

The classical binary knapsack problem has numerous generalisations in relation to not only a capacity constraint but also an objective function. In 2006, two knapsack problems have coincidentally been proposed, both of which have an extension of the objective function paying the penalty. This article gives some comments on the two problems.

Suggested Citation

  • Iida, Hiroshi, 2007. "Comments on knapsack problems with a penalty," ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) 10252/910, Otaru University of Commerce.
    • Handle: RePEc:ota:busdis:10252/910
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    References listed on IDEAS

    as
    1. Gang Yu, 1996. "On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications," Operations Research, INFORMS, vol. 44(2), pages 407-415, April.
    Full references (including those not matched with items on IDEAS)

    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. Alexandre Belloni & Mitchell J. Lovett & William Boulding & Richard Staelin, 2012. "Optimal Admission and Scholarship Decisions: Choosing Customized Marketing Offers to Attract a Desirable Mix of Customers," Marketing Science, INFORMS, vol. 31(4), pages 621-636, July.
    2. Sbihi, Abdelkader, 2010. "A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 339-346, April.
    3. Alireza Amirteimoori & Simin Masrouri, 2021. "DEA-based competition strategy in the presence of undesirable products: An application to paper mills," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 5-21.
    4. Fabrice Talla Nobibon & Roel Leus, 2014. "Complexity Results and Exact Algorithms for Robust Knapsack Problems," Journal of Optimization Theory and Applications, Springer, vol. 161(2), pages 533-552, May.
    5. Adam Kasperski & Paweł Zieliński, 2009. "A randomized algorithm for the min-max selecting items problem with uncertain weights," Annals of Operations Research, Springer, vol. 172(1), pages 221-230, November.
    6. Thekra Al-douri & Mhand Hifi & Vassilis Zissimopoulos, 2021. "An iterative algorithm for the Max-Min knapsack problem with multiple scenarios," Operational Research, Springer, vol. 21(2), pages 1355-1392, June.
    7. Fabio Furini & Manuel Iori & Silvano Martello & Mutsunori Yagiura, 2015. "Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 392-405, May.
    8. Christina Büsing & Sebastian Goderbauer & Arie M. C. A. Koster & Manuel Kutschka, 2019. "Formulations and algorithms for the recoverable $${\varGamma }$$ Γ -robust knapsack problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(1), pages 15-45, March.
    9. Florian Biermann & Victor Naroditskiy & Maria Polukarov & Alex Rogers & Nicholas Jennings, 2011. "Task Assignment with Autonomous and Controlled Agents," Working Papers 004-11, International School of Economics at TSU, Tbilisi, Republic of Georgia.
    10. S Das & D Ghosh, 2003. "Binary knapsack problems with random budgets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(9), pages 970-983, September.
    11. Nikulin, Yury, 2006. "Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 606, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Hanan Luss, 1999. "On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach," Operations Research, INFORMS, vol. 47(3), pages 361-378, June.
    13. G. Yu, 1998. "Min-Max Optimization of Several Classical Discrete Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 98(1), pages 221-242, July.
    14. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.

    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:ota:busdis:10252/910. 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: Miura, Chiho (email available below). General contact details of provider: https://edirc.repec.org/data/deotajp.html .

    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.