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

ISSN： 0254-5330

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

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

Variable and large neighborhood search to solve the multiobjective set covering problem

By Lust T. Tuyttens D.

Journal of Heuristics, Vol. 20, Iss. 2, 2014-04 ,pp. : 165-188

Springer Publishing Company

Access to resources Recommend Favorite

A study of the bi-objective next release problem

By Durillo Juan

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

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms for the Set Covering Problem

By Caprara A.

Annals of Operations Research, Vol. 98, Iss. 1-4, 2000-12 ,pp. : 353-371

Springer Publishing Company

Access to resources Recommend Favorite

A finite element based level set method for two-phase incompressible flows

By Groß Sven Reichelt Volker Reusken Arnold

Computing and Visualization in Science, Vol. 9, Iss. 4, 2006-12 ,pp. : 239-257

Springer Publishing Company

Access to resources Recommend Favorite