Bi-Objective Median Subtree Location Problems

By George J.W.  

Annals of Operations Research, Vol. 122, Iss. 1-4, 2003-09 ,pp. : 219-232

Springer Publishing Company

Access to resources Recommend Favorite

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

By Argyris Nikolaos   Figueira José   Morton Alec  

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

Springer Publishing Company

Access to resources Recommend Favorite

Bi-objective optimization of induction machine using interval-based interactive algorithms

By Samarkanov Dmitry   Gillon Frédéric   Brochet Pascal   Laloy Daniel  

COMPEL: Int J for Computation and Maths. in Electrical and Electronic Eng., Vol. 33, Iss. 3, 2014-04 ,pp. : 729-744

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Exact and greedy solutions of the knapsack problem: the ratio of values of objective functions

By Korbut A.   Sigal I.  

Journal of Computer and Systems Sciences International, Vol. 49, Iss. 5, 2010-10 ,pp. : 757-764

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example

By Villegas Juan   Palacios Fernando   Medaglia Andrés  

Annals of Operations Research, Vol. 147, Iss. 1, 2006-10 ,pp. : 109-141

Springer Publishing Company

Access to resources Recommend Favorite