A study of the bi-objective next release problem

ISSN： 1382-3256

Source： Empirical Software Engineering, Vol.16, Iss.1, 2011-02, pp. : 29-60

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 Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm

By Jaszkiewicz Andrzej

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 135-158

Springer Publishing Company

Access to resources Recommend Favorite

Grouping genetic algorithms for a bi-objective inventory routing problem

By Sadok Abdeljawed

International Journal of Multicriteria Decision Making, Vol. 3, Iss. 2-3, 2013-05 ,pp. : 256-276

Inderscience Publishers

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

Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem

By Prins Christian

Annals of Operations Research, Vol. 147, Iss. 1, 2006-10 ,pp. : 23-41

Springer Publishing Company

Access to resources Recommend Favorite

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