![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
MCDM 2013: Singapore
- 2013 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making, MCDM 2013, Singapore, April 16-19, 2013. IEEE 2013, ISBN 978-1-4673-5889-7
- Long Nguyen, Lam Thu Bui
, Hussein A. Abbass
:
A new niching method for the direction-based multi-objective evolutionary algorithm. 1-8 - Miguel A. Medina, Swagatam Das
, Carlos A. Coello Coello
, Juan M. Ramirez:
Two decomposition-based modem metaheuristic algorithms for multi-objective optimization - A comparative study. 9-16 - David Morgan, Antony Waldock, David Corne:
MOPC/D: A new probability collectives algorithm for multiobjective optimisation. 17-24 - Hisao Ishibuchi
, Masakazu Yamane, Yusuke Nojima
:
Effects of duplicated objectives in many-objective optimization problems on the search behavior of hypervolume-based evolutionary algorithms. 25-32 - Farouk Aissanou, Alain Pétrowski:
Autonomous multi-criteria decision making for route selection in a telecommunication network. 33-40 - Madalina M. Drugan
:
Sets of interacting scalarization functions in local search for multi-objective combinatorial optimization problems. 41-47 - Saúl Zapotecas Martínez
, Carlos A. Coello Coello
:
A hybridization of MOEA/D with the nonlinear simplex search algorithm. 48-55 - Salman A. Khan, Mohamed Baqer
:
Goal programming approach for multi-criteria decision-making for an energy efficient event recognition scheme. 56-60
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.