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

Three approximation algorithms for solving the generalized segregated storage problem

Author

Listed:
  • Barbucha, Dariusz

Abstract

No abstract is available for this item.

Suggested Citation

  • Barbucha, Dariusz, 2004. "Three approximation algorithms for solving the generalized segregated storage problem," European Journal of Operational Research, Elsevier, vol. 156(1), pages 54-72, July.
    • Handle: RePEc:eee:ejores:v:156:y:2004:i:1:p:54-72
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00917-7
    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. Stelios H. Zanakis, 1977. "Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods," Management Science, INFORMS, vol. 24(1), pages 91-104, September.
    2. Mohammad M. Amini & Richard S. Barr, 1993. "Network Reoptimization Algorithms: A Statistically Designed Comparison," INFORMS Journal on Computing, INFORMS, vol. 5(4), pages 395-409, November.
    3. Zanakis, Stelios H. & Evans, James R. & Vazacopoulos, Alkis A., 1989. "Heuristic methods and applications: A categorized survey," European Journal of Operational Research, Elsevier, vol. 43(1), pages 88-110, November.
    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. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    2. Corbett, Charles J. & Debets, Frank J.C. & Van Wassenhove, Luk N., 1995. "Decentralization of responsibility for site decontamination projects: A budget allocation approach," European Journal of Operational Research, Elsevier, vol. 86(1), pages 103-119, October.
    3. Jerzy Grobelny & Rafal Michalski, 2016. "A concept of a flexible approach to the facilities layout problems in logistics systems," WORking papers in Management Science (WORMS) WORMS/16/11, Department of Operations Research and Business Intelligence, Wroclaw University of Science and Technology.
    4. Camponogara, Eduardo & Talukdar, Sarosh, 2004. "Designing communication networks for distributed control agents," European Journal of Operational Research, Elsevier, vol. 153(3), pages 544-563, March.
    5. Marins, Fernando A. S. & Senne, Edson L. F. & Darby-Dowman, Ken & Machado, Arlene F. & Perin, Clovis, 1997. "Algorithms for network piecewise-linear programs: A comparative study," European Journal of Operational Research, Elsevier, vol. 97(1), pages 183-199, February.
    6. Fernandez-Viagas, Victor & Ruiz, Rubén & Framinan, Jose M., 2017. "A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation," European Journal of Operational Research, Elsevier, vol. 257(3), pages 707-721.
    7. Schmitt, Lawrence J. & Amini, Mohammad M., 1998. "Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 551-570, August.
    8. 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.
    9. Belarmino Adenso-Díaz & Manuel Laguna, 2006. "Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search," Operations Research, INFORMS, vol. 54(1), pages 99-114, February.
    10. Nussbaum, M. & Sepulveda, M. & Cobian, A. & Gaete, J. & Parra, E. & Cruz, J., 1997. "A fuel distribution knowledge-based decision support system," Omega, Elsevier, vol. 25(2), pages 225-234, April.
    11. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    12. Bahram Alidaee & Vijay P. Ramalingam & Haibo Wang & Bryan Kethley, 2018. "Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem," Annals of Operations Research, Springer, vol. 269(1), pages 3-19, October.
    13. Marie Coffin & Matthew J. Saltzman, 2000. "Statistical Analysis of Computational Tests of Algorithms and Heuristics," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 24-44, February.
    14. Nur Azriati Mat* & Aida Mauziah Benjamin & Syariza Abdul-Rahman, 2018. "Efficiency of Heuristic Algorithms in Solving Waste Collection Vehicle Routing Problem: A Case Study," The Journal of Social Sciences Research, Academic Research Publishing Group, pages 695-700:6.
    15. Shang, You-lin & Zhang, Lian-sheng, 2008. "Finding discrete global minima with a filled function for integer programming," European Journal of Operational Research, Elsevier, vol. 189(1), pages 31-40, August.
    16. 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.
    17. Kyparisis, George J. & Gupta, Sushil K. & Ip, Chi-Ming, 1996. "Project selection with discounted returns and multiple constraints," European Journal of Operational Research, Elsevier, vol. 94(1), pages 87-96, October.
    18. C Gagné & M Gravel & W L Price, 2005. "Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(6), pages 687-698, June.
    19. Knolmayer, Gerhard, 1981. "A simulation study of simplification strategies in the development of optimization models," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 96, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Hassan, Mohsen M. D., 2000. "Toward re-engineering models and algorithms of facility layout," Omega, Elsevier, vol. 28(6), pages 711-723, December.

    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:156:y:2004:i:1:p:54-72. 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.