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

The impact of energy function structure on solving generalized assignment problem using Hopfield neural network

Author

Listed:
  • Monfared, M.A.S.
  • Etemadi, M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Monfared, M.A.S. & Etemadi, M., 2006. "The impact of energy function structure on solving generalized assignment problem using Hopfield neural network," European Journal of Operational Research, Elsevier, vol. 168(2), pages 645-654, January.
    • Handle: RePEc:eee:ejores:v:168:y:2006:i:2:p:645-654
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00454-0
    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. Kate A. Smith, 1999. "Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 15-34, February.
    2. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, 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. Salim Haddadi, 2019. "Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem," 4OR, Springer, vol. 17(3), pages 261-295, September.

    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. M Büther, 2010. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1582-1595, November.
    2. Büther, Marcel, 2007. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 632, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    4. Eric Larsen & Sébastien Lachapelle & Yoshua Bengio & Emma Frejinger & Simon Lacoste-Julien & Andrea Lodi, 2022. "Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 227-242, January.
    5. Stanimirović, Predrag & Gerontitis, Dimitris & Tzekis, Panagiotis & Behera, Ratikanta & Sahoo, Jajati Keshari, 2021. "Simulation of Varying Parameter Recurrent Neural Network with application to matrix inversion," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 185(C), pages 614-628.
    6. Büther, Marcel, 2008. "Beam search for the elastic generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 634, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Mehdi Mrad & Anis Gharbi & Mohamed Haouari & Mohamed Kharbeche, 2016. "An optimization-based heuristic for the machine reassignment problem," Annals of Operations Research, Springer, vol. 242(1), pages 115-132, July.
    8. Emilio Moretti & Elena Tappia & Veronique Limère & Marco Melacini, 2021. "Exploring the application of machine learning to the assembly line feeding problem," Operations Management Research, Springer, vol. 14(3), pages 403-419, December.
    9. Iakov Karandashev & Boris Kryzhanovsky, 2013. "Increasing the attraction area of the global minimum in the binary optimization problem," Journal of Global Optimization, Springer, vol. 56(3), pages 1167-1185, July.
    10. Diana Goettsch & Krystel K. Castillo-Villar & Maria Aranguren, 2020. "Machine-Learning Methods to Select Potential Depot Locations for the Supply Chain of Biomass Co-Firing," Energies, MDPI, vol. 13(24), pages 1-18, December.
    11. Carrasco, M. P. & Pato, M. V., 2004. "A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 65-79, February.
    12. Stavrou, Eleni T. & Charalambous, Christakis & Spiliotis, Stelios, 2007. "Human resource management and performance: A neural network analysis," European Journal of Operational Research, Elsevier, vol. 181(1), pages 453-467, August.
    13. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
    14. Gelareh, Shahin & Glover, Fred & Guemri, Oualid & Hanafi, Saïd & Nduwayo, Placide & Todosijević, Raca, 2020. "A comparative study of formulations for a cross-dock door assignment problem," Omega, Elsevier, vol. 91(C).
    15. Bengio, Yoshua & Lodi, Andrea & Prouvost, Antoine, 2021. "Machine learning for combinatorial optimization: A methodological tour d’horizon," European Journal of Operational Research, Elsevier, vol. 290(2), pages 405-421.
    16. Jatinder N. D. Gupta & Randall S. Sexton & Enar A. Tunc, 2000. "Selecting Scheduling Heuristics Using Neural Networks," INFORMS Journal on Computing, INFORMS, vol. 12(2), pages 150-162, May.
    17. Stavrou, Eleni & Spiliotis, Stelios & Charalambous, Chris, 2010. "Flexible working arrangements in context: An empirical investigation through self-organizing maps," European Journal of Operational Research, Elsevier, vol. 202(3), pages 893-902, May.
    18. Drexl, Andreas & Jørnsten, Kurt, 2007. "Pricing the generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 627, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Christoph Hertrich & Martin Skutella, 2023. "Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1079-1097, September.
    20. Justin J. Boutilier & Timothy C. Y. Chan, 2023. "Introducing and Integrating Machine Learning in an Operations Research Curriculum: An Application-Driven Course," INFORMS Transactions on Education, INFORMS, vol. 23(2), pages 64-83, January.

    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:168:y:2006:i:2:p:645-654. 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.