Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem

Author： Argyris Nikolaos Figueira José Morton Alec

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.49, Iss.2, 2011-02, pp. : 213-235

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A novel particle swarm algorithm for multi-objective optimisation problem

By Zhang Jiande Huang Chenrong Xu Jinbao Lu Jingui

International Journal of Modelling, Identification and Control, Vol. 18, Iss. 4, 2013-04 ,pp. : 380-386

Inderscience Publishers

Access to resources Recommend Favorite

An Application of a Multi-Objective Tabu Search Algorithm to a Bicriteria Flowshop Problem

By Armentano Vinícius Amaral Claudio José Elias

Journal of Heuristics, Vol. 10, Iss. 5, 2004-09 ,pp. : 463-481

Springer Publishing Company

Access to resources Recommend Favorite

Multi-objective genetic algorithms for flights amalgamation problem

By Waheed Mohamed Elsayed Makhlouf Mohamed Abd Allah

International Journal of Computer Applications in Technology, Vol. 45, Iss. 4, 2012-12 ,pp. : 254-265

Inderscience Publishers

Access to resources Recommend Favorite

Multi-objective Genetic Algorithms for grouping problems

By Korkmaz Emin

Applied Intelligence, Vol. 33, Iss. 2, 2010-10 ,pp. : 179-192

Springer Publishing Company

Access to resources Recommend Favorite

An approximation algorithm for convex multi-objective programming problems

By Ehrgott Matthias

Journal of Global Optimization, Vol. 50, Iss. 3, 2011-07 ,pp. : 397-416

Springer Publishing Company

Access to resources Recommend Favorite