@inproceedings{Deb2005b,
abstract = {Due to the vagaries of optimization problems encountered in practice, users resort to different algorithms for solving different optimization problems. In this paper, we suggest an optimization procedure which specializes in solving multi-objective, multi-global problems. The algorithm is carefully designed so as to degenerate to efficient algorithms for solving other simpler optimization problems, such as single-objective uni-global problems, single-objective multi-global problems and multiobjective uni-global problems. The efficacy of the proposed algorithm in solving various problems is demonstrated on a number of test problems. Because of it's efficiency in handling different types of problems with equal ease, this algorithm should find increasing use in real-world optimization problems. {\textcopyright} Springer-Verlag Berlin Heidelberg 2005.},
author = {Deb, Kalyanmoy and Tiwari, Santosh},
booktitle = {Lecture Notes in Computer Science},
doi = {10.1007/978-3-540-31880-4_4},
issn = {03029743},
mendeley-groups = {COIN{\_}website/2004},
pages = {47--61},
publisher = {Springer, Berlin, Heidelberg},
title = {{Omni-optimizer: A procedure for single and multi-objective optimization}},
url = {https://link.springer.com/chapter/10.1007/978-3-540-31880-4{\_}4},
volume = {3410},
year = {2005}
}