IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v42y2009i3p393-419.html
   My bibliography  Save this article

Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods

Author

Listed:
  • José Fernández
  • Boglárka Tóth

Abstract

No abstract is available for this item.

Suggested Citation

  • José Fernández & Boglárka Tóth, 2009. "Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods," Computational Optimization and Applications, Springer, vol. 42(3), pages 393-419, April.
    • Handle: RePEc:spr:coopap:v:42:y:2009:i:3:p:393-419
    DOI: 10.1007/s10589-007-9135-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-007-9135-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-007-9135-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Ehrgott, Matthias & Klamroth, Kathrin & Schwehm, Christian, 2004. "An MCDM approach to portfolio optimization," European Journal of Operational Research, Elsevier, vol. 155(3), pages 752-770, June.
    2. Silverman, Joe & Steuer, Ralph E. & Whisman, Alan W., 1988. "A multi-period, multiple criteria optimization system for manpower planning," European Journal of Operational Research, Elsevier, vol. 34(2), pages 160-170, March.
    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. J. L. Redondo & J. Fernández & P. M. Ortigosa, 2017. "FEMOEA: a fast and efficient multi-objective evolutionary algorithm," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 85(1), pages 113-135, February.
    2. Gupta, Pankaj & Mittal, Garima & Mehlawat, Mukesh Kumar, 2013. "Expected value multiobjective portfolio rebalancing model with fuzzy parameters," Insurance: Mathematics and Economics, Elsevier, vol. 52(2), pages 190-203.
    3. Florian Methling & Rüdiger Nitzsch, 2019. "Thematic portfolio optimization: challenging the core satellite approach," Financial Markets and Portfolio Management, Springer;Swiss Society for Financial Market Research, vol. 33(2), pages 133-154, June.
    4. Mahdi Massahi & Masoud Mahootchi & Alireza Arshadi Khamseh, 2020. "Development of an efficient cluster-based portfolio optimization model under realistic market conditions," Empirical Economics, Springer, vol. 59(5), pages 2423-2442, November.
    5. Emmanuel Jurczenko & Bertrand Maillet & Paul Merlin, 2008. "Efficient Frontier for Robust Higher-order Moment Portfolio Selection," Post-Print halshs-00336475, HAL.
    6. Yongjian Li & Jian Chen & Xiaoqiang Cai, 2007. "An integrated staff-sizing approach considering feasibility of scheduling decision," Annals of Operations Research, Springer, vol. 155(1), pages 361-390, November.
    7. A. Garcia-Bernabeu & J. V. Salcedo & A. Hilario & D. Pla-Santamaria & Juan M. Herrero, 2019. "Computing the Mean-Variance-Sustainability Nondominated Surface by ev-MOGA," Complexity, Hindawi, vol. 2019, pages 1-12, December.
    8. Fereshteh Akbari & Mehrdad Ghaznavi & Esmaile Khorram, 2018. "A Revised Pascoletti–Serafini Scalarization Method for Multiobjective Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 560-590, August.
    9. Engau, Alexander, 2009. "Tradeoff-based decomposition and decision-making in multiobjective programming," European Journal of Operational Research, Elsevier, vol. 199(3), pages 883-891, December.
    10. Alexander Nikiporenko, 2023. "Time-limited Metaheuristics for Cardinality-constrained Portfolio Optimisation," Papers 2307.04045, arXiv.org.
    11. Benita, Francisco & López-Ramos, Francisco & Nasini, Stefano, 2019. "A bi-level programming approach for global investment strategies with financial intermediation," European Journal of Operational Research, Elsevier, vol. 274(1), pages 375-390.
    12. Rafael Rodríguez & Mariano Luque & Mercedes González, 2011. "Portfolio selection in the Spanish stock market by interactive multiobjective programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(1), pages 213-231, July.
    13. Yue Qi & Ralph E. Steuer, 2020. "On the analytical derivation of efficient sets in quad-and-higher criterion portfolio selection," Annals of Operations Research, Springer, vol. 293(2), pages 521-538, October.
    14. Walid Bakry & Audil Rashid & Somar Al-Mohamad & Nasser El-Kanj, 2021. "Bitcoin and Portfolio Diversification: A Portfolio Optimization Approach," JRFM, MDPI, vol. 14(7), pages 1-24, June.
    15. C-T Tsao, 2006. "A fuzzy MCDM approach for stock selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(11), pages 1341-1352, November.
    16. Amita Sharma & Aparna Mehra, 2017. "Financial analysis based sectoral portfolio optimization under second order stochastic dominance," Annals of Operations Research, Springer, vol. 256(1), pages 171-197, September.
    17. Woodside-Oriakhi, M. & Lucas, C. & Beasley, J.E., 2011. "Heuristic algorithms for the cardinality constrained efficient frontier," European Journal of Operational Research, Elsevier, vol. 213(3), pages 538-550, September.
    18. Markus Hirschberger & Ralph E. Steuer & Sebastian Utz & Maximilian Wimmer & Yue Qi, 2013. "Computing the Nondominated Surface in Tri-Criterion Portfolio Selection," Operations Research, INFORMS, vol. 61(1), pages 169-183, February.
    19. Werner, Christoph & Bedford, Tim & Cooke, Roger M. & Hanea, Anca M. & Morales-Nápoles, Oswaldo, 2017. "Expert judgement for dependence in probabilistic modelling: A systematic literature review and future research directions," European Journal of Operational Research, Elsevier, vol. 258(3), pages 801-819.
    20. Deng, Xue & Chen, Jiaxing & Wang, Xu & Geng, Fengting, 2022. "Non-dominated sorting genetic algorithm-II for possibilistic mean-semiabsolute deviation-Yager entropy portfolio model with complex real-world constraints," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 202(C), pages 59-78.

    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:spr:coopap:v:42:y:2009:i:3:p:393-419. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.