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

Approximate solutions to the turbine balancing problem

Author

Listed:
  • Pitsoulis, Leonidas S.
  • Pardalos, Panos M.
  • Hearn, Donald W.

Abstract

No abstract is available for this item.

Suggested Citation

  • Pitsoulis, Leonidas S. & Pardalos, Panos M. & Hearn, Donald W., 2001. "Approximate solutions to the turbine balancing problem," European Journal of Operational Research, Elsevier, vol. 130(1), pages 147-155, April.
    • Handle: RePEc:eee:ejores:v:130:y:2001:i:1:p:147-155
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(00)00029-1
    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. Mosevich, Jack, 1986. "Balancing hydraulic turbine runners--A discrete combinatorial optimization problem," European Journal of Operational Research, Elsevier, vol. 26(2), pages 202-204, August.
    2. Mavridou, T. & Pardalos, P.M. & Pitsoulis, L.S. & Resende, Mauricio G.C., 1998. "A GRASP for the biquadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 105(3), pages 613-621, March.
    3. Fathi, Yahya & Ginjupalli, Krishna K., 1993. "A mathematical model and a heuristic procedure for the turbine balancing problem," European Journal of Operational Research, Elsevier, vol. 65(3), pages 336-342, March.
    4. Laporte, Gilbert & Mercure, Helene, 1988. "Balancing hydraulic turbine runners: A quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 35(3), pages 378-381, June.
    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. George Polak, 2005. "On A Special Case of the Quadratic Assignment Problem with an Application to Storage-and-Retrieval Devices," Annals of Operations Research, Springer, vol. 138(1), pages 223-233, September.
    2. Renata M. Aiex & Mauricio G. C. Resende & Panos M. Pardalos & Gerardo Toraldo, 2005. "GRASP with Path Relinking for Three-Index Assignment," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 224-247, May.
    3. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    4. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.

    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. Samir V. Amiouny & John J. Bartholdi & John H. Vande Vate, 2000. "Heuristics for Balancing Turbine Fans," Operations Research, INFORMS, vol. 48(4), pages 591-602, August.
    2. Richárd Molnár-Szipai & Anita Varga, 2019. "Integrating combinatorial algorithms into a linear programming solver," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 475-482, June.
    3. Anjos, Miguel F. & Vieira, Manuel V.C., 2017. "Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions," European Journal of Operational Research, Elsevier, vol. 261(1), pages 1-16.
    4. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
    5. White, D. J., 1995. "Some concave-convex representations of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 80(2), pages 418-424, January.
    6. Berman, Oded & Sanajian, Nima & Wang, Jiamin, 2017. "Location choice and risk attitude of a decision maker," Omega, Elsevier, vol. 66(PA), pages 170-181.
    7. Anjos, Miguel F. & Fischer, Anja & Hungerländer, Philipp, 2018. "Improved exact approaches for row layout problems with departments of equal length," European Journal of Operational Research, Elsevier, vol. 270(2), pages 514-529.
    8. Asef-Vaziri, Ardavan & Laporte, Gilbert, 2005. "Loop based facility planning and material handling," European Journal of Operational Research, Elsevier, vol. 164(1), pages 1-11, July.
    9. Xiaolong Kuang & Luis F. Zuluaga, 2018. "Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization," Journal of Global Optimization, Springer, vol. 70(3), pages 551-577, March.
    10. Hungerländer, Philipp & Anjos, Miguel F., 2015. "A semidefinite optimization-based approach for global optimization of multi-row facility layout," European Journal of Operational Research, Elsevier, vol. 245(1), pages 46-61.
    11. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    12. Bock, Stefan & Hoberg, Kai, 2007. "Detailed layout planning for irregularly-shaped machines with transportation path design," European Journal of Operational Research, Elsevier, vol. 177(2), pages 693-718, March.
    13. Susan Heath & Jonathan Bard & Douglas Morrice, 2013. "A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines," Annals of Operations Research, Springer, vol. 203(1), pages 295-323, March.
    14. Renata M. Aiex & Mauricio G. C. Resende & Panos M. Pardalos & Gerardo Toraldo, 2005. "GRASP with Path Relinking for Three-Index Assignment," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 224-247, May.
    15. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam, 2021. "Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1066-1084.
    16. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    17. Paquete, Luis & Stutzle, Thomas, 2006. "A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices," European Journal of Operational Research, Elsevier, vol. 169(3), pages 943-959, March.
    18. Itai Ashlagi & Peng Shi, 2014. "Improving Community Cohesion in School Choice via Correlated-Lottery Implementation," Operations Research, INFORMS, vol. 62(6), pages 1247-1264, December.
    19. Ajagekar, Akshay & You, Fengqi, 2019. "Quantum computing for energy systems optimization: Challenges and opportunities," Energy, Elsevier, vol. 179(C), pages 76-89.
    20. Krokhmal, Pavlo A. & Pardalos, Panos M., 2009. "Random assignment problems," European Journal of Operational Research, Elsevier, vol. 194(1), pages 1-17, April.

    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:130:y:2001:i:1:p:147-155. 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.