Advertisement

Soft Computing for Complex MCDM Problems

Chapter
  • 537 Downloads
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 85)

Keywords

Soft Computing Portfolio Selection Solve Optimization Problem Parametric Bound Portfolio Selection Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. Annotated References

  1. Evtushenko Yu. G., Potapov M.A., (1986), Methods of Numerical Solution of Multicriterion Problems. Soviet Mathematical Doklady, 34, 420–423.Google Scholar
  2. Kaliszewski I., (1994b), Quantitative Pareto Analysis by Cone Separation Technique. Kluwer Academic Publishers, Boston.Google Scholar
  3. Kaliszewski I., (2000), Using trade-off information in decision making algorithms. Computers & Operations Research, 27, 161–182.zbMATHMathSciNetCrossRefGoogle Scholar
  4. Kaliszewski I., (2001a), Eliciting information on efficient outcomes prior to explicitly identyfying them. Scientific Transactions of the Department of Mechanics, Koszalin University of Technology, Koszalin, 157–164.Google Scholar
  5. Kaliszewski I., (2001b), Multiple criteria decision making without optimization. Systems Science, 27, 5–13.MathSciNetGoogle Scholar
  6. Kaliszewski I., (2002a), Trade-offs–a lost dimension in multiple criteria decision making. In: Multi-Objective Programming and Goal Programming, Recent Developments, (Trzaskalik T., Michnik J., eds.), Physica-Verlag, 115–126.Google Scholar
  7. Kaliszewski I., (2002b), Multiple criteria decision making with deductive approximate representation of efficient outcomes. Control & Cybernetics, 31, 949–964.Google Scholar
  8. Kaliszewski I., (2003a), Weighting versus reference point multiple criteria decision making methods–analogies and differences. Journal of Telecommunication and Information Technologies, 3, 9–15.Google Scholar
  9. Kaliszewski I., (2003b), Dynamic parametric bounds on efficient outcomes in multiple criteria decision making. European Journal of Operational Research, 147, 94–107.zbMATHMathSciNetCrossRefGoogle Scholar
  10. Kaliszewski I., (2004), Out of the mist — towards decision-maker-friendly multiple criteria decision making support. European Journal of Operational Research, 158, 293–307.zbMATHMathSciNetCrossRefGoogle Scholar
  11. Kaliszewski I., Michalowski W., (1995), Generation of outcomes with selectively bounded tradeoffs. Foundations of Computing and Decision Sciences, 20, 113–122.MathSciNetGoogle Scholar
  12. Kaliszewski I., Michalowski W., (1997), Efficient solutions and bounds on tradeoffs. Journal of Optimization Theory and Applications, 94, 381–394.MathSciNetCrossRefGoogle Scholar
  13. Kaliszewski I., Michalowski W., (1999), Searching for psychologically stable solutions of multiple criteria decision problems. European Journal of Operational Research, 118, 549–562.CrossRefGoogle Scholar
  14. Kaliszewski I., Michalowski W., Kersten G.E., (1997), A hybrid interactive technique for MCDM problems. In: Essays in Decision Making, (Karwan M., Spronk J., Wallenius J., eds.), Springer Verlag, Heidelberg, 48–59.Google Scholar
  15. Kaliszewski I., Zionts S., (2004), Generalization of the Zionts-Wallenius multicriteria decision making algorithm. Control & Cybernetics, 3, 477–500.MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Personalised recommendations