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

Path relinking and GRG for artificial neural networks

Author

Listed:
  • El-Fallahi, Abdellah
  • Marti, Rafael
  • Lasdon, Leon

Abstract

No abstract is available for this item.

Suggested Citation

  • El-Fallahi, Abdellah & Marti, Rafael & Lasdon, Leon, 2006. "Path relinking and GRG for artificial neural networks," European Journal of Operational Research, Elsevier, vol. 169(2), pages 508-519, March.
    • Handle: RePEc:eee:ejores:v:169:y:2006:i:2:p:508-519
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00551-X
    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. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
    2. Stuart Smith & Leon Lasdon, 1992. "Solving Large Sparse Nonlinear Programs Using GRG," INFORMS Journal on Computing, INFORMS, vol. 4(1), pages 2-15, February.
    3. Manuel Laguna & Fred Glover, 1993. "Bandwidth Packing: A Tabu Search Approach," Management Science, INFORMS, vol. 39(4), pages 492-500, 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. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.
    2. Vidyarthi, Navneet & Jayaswal, Sachin & Chetty, Vikranth Babu Tirumala, 2013. "Exact Solution to Bandwidth Packing Problem with Queuing Delays," IIMA Working Papers WP2013-11-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    3. Kafle, Nabin & Zou, Bo & Lin, Jane, 2017. "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 62-82.
    4. Baldacci, R. & Dell'Amico, M., 2010. "Heuristic algorithms for the multi-depot ring-star problem," European Journal of Operational Research, Elsevier, vol. 203(1), pages 270-281, May.
    5. Bretthauer, Kurt M. & Cote, Murray J., 1997. "Nonlinear programming for multiperiod capacity planning in a manufacturing system," European Journal of Operational Research, Elsevier, vol. 96(1), pages 167-179, January.
    6. Michael Brusco & Douglas Steinley, 2007. "A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning," Psychometrika, Springer;The Psychometric Society, vol. 72(4), pages 583-600, December.
    7. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
    8. Patriksson, Michael, 2008. "A survey on the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 185(1), pages 1-46, February.
    9. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    10. G.-Fivos Sargentis & Theano Iliopoulou & Stavroula Sigourou & Panayiotis Dimitriadis & Demetris Koutsoyiannis, 2020. "Evolution of Clustering Quantified by a Stochastic Method—Case Studies on Natural and Human Social Structures," Sustainability, MDPI, vol. 12(19), pages 1-22, September.
    11. Carlos Llano & Almudena Esteban & Julian Pérez & Antonio Pulido, 2010. "Opening the Interregional Trade ‘‘Black Box’’: The C-Intereg Database for the Spanish Economy (1995—2005)," International Regional Science Review, , vol. 33(3), pages 302-337, July.
    12. Costamagna, Eugenio & Fanni, Alessandra & Giacinto, Giorgio, 1998. "A Tabu Search algorithm for the optimisation of telecommunication networks," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 357-372, April.
    13. Wen-Chyuan Chiang & Panagiotis Kouvelis & Timothy L. Urban, 2002. "Incorporating Workflow Interference in Facility Layout Design: The Quartic Assignment Problem," Management Science, INFORMS, vol. 48(4), pages 584-590, April.
    14. Pendharkar, Parag C., 2001. "An empirical study of design and testing of hybrid evolutionary-neural approach for classification," Omega, Elsevier, vol. 29(4), pages 361-374, August.
    15. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "A tabu search algorithm for the training of neural networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 282-291, February.
    16. Amiri, Ali, 2005. "The selection and scheduling of telecommunication calls with time windows," European Journal of Operational Research, Elsevier, vol. 167(1), pages 243-256, November.
    17. Seohee Kim & Chungmok Lee, 2021. "A branch and price approach for the robust bandwidth packing problem with queuing delays," Annals of Operations Research, Springer, vol. 307(1), pages 251-275, December.
    18. Bose, Indranil, 2009. "Bandwidth packing with priority classes," European Journal of Operational Research, Elsevier, vol. 192(1), pages 313-325, January.
    19. Marti, Rafael & Laguna, Manuel & Glover, Fred, 2006. "Principles of scatter search," European Journal of Operational Research, Elsevier, vol. 169(2), pages 359-372, March.
    20. Torrealba, E.M.R. & Silva, J.G. & Matioli, L.C. & Kolossoski, O. & Santos, P.S.M., 2022. "Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem," European Journal of Operational Research, Elsevier, vol. 299(1), pages 46-59.

    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:169:y:2006:i:2:p:508-519. 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.