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

The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem

Author

Listed:
  • Lee, Tae-Eog
  • Oh, Geun Tae

Abstract

No abstract is available for this item.

Suggested Citation

  • Lee, Tae-Eog & Oh, Geun Tae, 1997. "The asymptotic value-to-capacity ratio for the multi-class stochastic knapsack problem," European Journal of Operational Research, Elsevier, vol. 103(3), pages 584-594, December.
    • Handle: RePEc:eee:ejores:v:103:y:1997:i:3:p:584-594
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00308-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. Frieze, A. M. & Clarke, M. R. B., 1984. "Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses," European Journal of Operational Research, Elsevier, vol. 15(1), pages 100-109, January.
    2. Wansoo T. Rhee & Michel Talagrand, 1987. "Martingale Inequalities and NP-Complete Problems," Mathematics of Operations Research, INFORMS, vol. 12(1), pages 177-181, February.
    3. Wansoo T. Rhee & Michel Talagrand, 1989. "Martingale Inequalities, Interpolation and NP-Complete Problems," Mathematics of Operations Research, INFORMS, vol. 14(1), pages 91-96, February.
    4. Szkatula, Krzysztof, 1994. "The growth of multi-constraint random knapsacks with various right-hand sides of the constraints," European Journal of Operational Research, Elsevier, vol. 73(1), pages 199-204, February.
    5. Schilling, Kenneth E., 1990. "The growth of m-constraint random knapsacks," European Journal of Operational Research, Elsevier, vol. 46(1), pages 109-112, May.
    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. Chen, Kai & Ross, Sheldon M., 2014. "An adaptive stochastic knapsack problem," European Journal of Operational Research, Elsevier, vol. 239(3), pages 625-635.

    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. Szkatula, Krzysztof, 1998. "Random sequencing jobs with deadlines problem: Growth of the optimal solution values," European Journal of Operational Research, Elsevier, vol. 109(1), pages 160-169, August.
    3. 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.
    4. Dimitris Bertsimas & Ramazan Demir, 2002. "An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems," Management Science, INFORMS, vol. 48(4), pages 550-565, April.
    5. Yoon, Yourim & Kim, Yong-Hyuk & Moon, Byung-Ro, 2012. "A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 218(2), pages 366-376.
    6. Sabah Bushaj & İ. Esra Büyüktahtakın, 2024. "A K-means Supported Reinforcement Learning Framework to Multi-dimensional Knapsack," Journal of Global Optimization, Springer, vol. 89(3), pages 655-685, July.
    7. Jacob B. Feldman & Huseyin Topaloglu, 2015. "Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model," Operations Research, INFORMS, vol. 63(4), pages 812-822, August.
    8. Aardal, K. & van Hoesel, C.P.M. & Lenstra, J.K. & Stougie, L., 1997. "A decade of combinatorial optimization," Research Memorandum 023, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    9. Rinnooy Kan, A. H. G., 1985. "Probabilistic Analysis Of Algorithms," Econometric Institute Archives 272328, Erasmus University Rotterdam.
    10. Wascher, Gerhard & Hau[ss]ner, Heike & Schumann, Holger, 2007. "An improved typology of cutting and packing problems," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1109-1130, December.
    11. Awi Federgruen & Joern Meissner, 2004. "Probabilistic Analysis of Multi-Item Capacitated Lot Sizing Problems," Working Papers MRG/0004, Department of Management Science, Lancaster University, revised Apr 2005.
    12. Thomas Erlebach & Hans Kellerer & Ulrich Pferschy, 2002. "Approximating Multiobjective Knapsack Problems," Management Science, INFORMS, vol. 48(12), pages 1603-1612, December.
    13. 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.
    14. Raymond R. Hill & Charles H. Reilly, 2000. "The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance," Management Science, INFORMS, vol. 46(2), pages 302-317, February.
    15. Caprara, Alberto & Kellerer, Hans & Pferschy, Ulrich & Pisinger, David, 2000. "Approximation algorithms for knapsack problems with cardinality constraints," European Journal of Operational Research, Elsevier, vol. 123(2), pages 333-345, June.
    16. Lap Mui Ann Chan & David Simchi-Levi, 1998. "Probabilistic Analyses and Algorithms for Three-Level Distribution Systems," Management Science, INFORMS, vol. 44(11-Part-1), pages 1562-1576, November.

    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:103:y:1997:i:3:p:584-594. 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.