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

Designing communication networks for distributed control agents

Author

Listed:
  • Camponogara, Eduardo
  • Talukdar, Sarosh

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:153:y:2004:i:3:p:544-563
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00262-5
    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. 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)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Eduardo Camponogara & Sarosh N. Talukdar, 2005. "Designing Communication Networks to Decompose Network Control Problems," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 207-223, May.

    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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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:153:y:2004:i:3:p:544-563. 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.