IDEAS home Printed from https://ideas.repec.org/p/zbw/kondp2/184.html
   My bibliography  Save this paper

Some notes on the computational complexity of optimal aggregation

Author

Listed:
  • Winker, Peter

Abstract

A combinatorical problem is said to be of high computational complexity, if it can be shown that every efficient algorithm needs a high amount of resources as measured in Computing time or storage capacity. This paper will (1) introduce some basic concepts of mathematical complexity theory; (2) show that the problem of Optimal Aggregation is of high computational complexity; and (3) outline a possible way to obtain results good enough for practical use despite of this high computational complexity.

Suggested Citation

  • Winker, Peter, 1992. "Some notes on the computational complexity of optimal aggregation," Discussion Papers, Series II 184, University of Konstanz, Collaborative Research Centre (SFB) 178 "Internationalization of the Economy".
    • Handle: RePEc:zbw:kondp2:184
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/101461/1/756468035.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Gunter Dueck & Peter Winker, 1992. "New concepts and algorithms for portfolio choice," Applied Stochastic Models and Data Analysis, John Wiley & Sons, vol. 8(3), pages 159-178, September.
    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. Chipman, John Somerset & Winker, Peter, 1994. "Optimal industrial classification: [an application to the German industrial classification system]," Discussion Papers, Series II 236, University of Konstanz, Collaborative Research Centre (SFB) 178 "Internationalization of the Economy".
    2. John S.nChipman & Peter Winker, "undated". "Optimal Industrial Classification in a Dynamic Model of Price Adjustment," Computing in Economics and Finance 1996 _013, Society for Computational Economics.

    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. Manuel Kleinknecht & Wing Lon Ng, 2015. "Minimizing Basel III Capital Requirements with Unconditional Coverage Constraint," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 22(4), pages 263-281, October.
    2. Thiemo Krink & Stefan Mittnik & Sandra Paterlini, 2009. "Differential evolution and combinatorial search for constrained index-tracking," Annals of Operations Research, Springer, vol. 172(1), pages 153-176, November.
    3. Manfred Gilli, Evis Kellezi, 2000. "Heuristic Approaches For Portfolio Optimization," Computing in Economics and Finance 2000 289, Society for Computational Economics.
    4. Schlottmann, Frank & Seese, Detlef, 2004. "A hybrid heuristic approach to discrete multi-objective optimization of credit portfolios," Computational Statistics & Data Analysis, Elsevier, vol. 47(2), pages 373-399, September.
    5. Massimiliano Kaucic & Mojtaba Moradi & Mohmmad Mirzazadeh, 2019. "Portfolio optimization by improved NSGA-II and SPEA 2 based on different risk measures," Financial Innovation, Springer;Southwestern University of Finance and Economics, vol. 5(1), pages 1-28, December.
    6. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    7. Chipman, J. & Winker, P., 2005. "Optimal aggregation of linear time series models," Computational Statistics & Data Analysis, Elsevier, vol. 49(2), pages 311-331, April.
    8. Andrea Scozzari & Fabio Tardella & Sandra Paterlini & Thiemo Krink, 2013. "Exact and heuristic approaches for the index tracking problem with UCITS constraints," Annals of Operations Research, Springer, vol. 205(1), pages 235-250, May.
    9. Chipman, John Somerset & Winker, Peter, 1994. "Optimal industrial classification: [an application to the German industrial classification system]," Discussion Papers, Series II 236, University of Konstanz, Collaborative Research Centre (SFB) 178 "Internationalization of the Economy".
    10. Björn Fastrich & Peter Winker, 2012. "Robust portfolio optimization with a hybrid heuristic algorithm," Computational Management Science, Springer, vol. 9(1), pages 63-88, February.
    11. Marianna Lyra & Akwum Onwunta & Peter Winker, 2015. "Threshold accepting for credit risk assessment and validation," Journal of Banking Regulation, Palgrave Macmillan, vol. 16(2), pages 130-145, April.
    12. Bj�rn Fastrich & Sandra Paterlini & Peter Winker, 2014. "Cardinality versus q -norm constraints for index tracking," Quantitative Finance, Taylor & Francis Journals, vol. 14(11), pages 2019-2032, November.
    13. Chipman, John Somerset & Winker, Peter, 1992. "Optimal aggregation by threshold accepting: An application to the German industrial classification system," Discussion Papers, Series II 180, University of Konstanz, Collaborative Research Centre (SFB) 178 "Internationalization of the Economy".
    14. Manfred Gilli & Evis Këllezi, 2000. "A Heuristic Approach to Portfolio Optimization," FAME Research Paper Series rp20, International Center for Financial Asset Management and Engineering.
    15. Hochradl, Markus & Wagner, Christian, 2010. "Trading the forward bias: Are there limits to speculation?," Journal of International Money and Finance, Elsevier, vol. 29(3), pages 423-441, April.
    16. Marianna Lyra, 2010. "Heuristic Strategies in Finance – An Overview," Working Papers 045, COMISEF.
    17. Peter Winker & Marianna Lyra & Chris Sharpe, 2011. "Least median of squares estimation by optimization heuristics with an application to the CAPM and a multi-factor model," Computational Management Science, Springer, vol. 8(1), pages 103-123, April.
    18. Winker, Peter, 1995. "Identification of multivariate AR-models by threshold accepting," Computational Statistics & Data Analysis, Elsevier, vol. 20(3), pages 295-307, September.
    19. Konstantinos Anagnostopoulos & Georgios Mamanis, 2011. "Multiobjective evolutionary algorithms for complex portfolio optimization problems," Computational Management Science, Springer, vol. 8(3), pages 259-279, August.
    20. Thiemo Krink & Sandra Paterlini, 2008. "Differential Evolution for Multiobjective Portfolio Optimization," Center for Economic Research (RECent) 021, University of Modena and Reggio E., Dept. of Economics "Marco Biagi".

    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:zbw:kondp2:184. 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: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/fwkonde.html .

    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.