On the set covering polytope:Facets with coefficients in {0, 1, 2, 3}

Author： M M B

E-ISSN： 1572-9338|81|1|343-356

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.81, Iss.1, 1998-01, pp. : 343-356

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

Related content

Facets of the Graph Coloring Polytope

By Coll P.

Annals of Operations Research, Vol. 116, Iss. 1-4, 2002-10 ,pp. : 79-90

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

On the system of word equations x 0 u i 1 x 1 u i 2 x 2 u i 3 x 3 = y 0 v i 1 y 1 v i 2 y 2 v i 3 y 3 (i = 0, 1 2, ...) in a free monoid

By Hakala I. Kortelainen J.

Theoretical Computer Science, Vol. 225, Iss. 1, 1999-08 ,pp. : 149-161

Elsevier

Access to resources Recommend Favorite

Set covering location models with stochastic critical distances

By Meng S

Journal of the Operational Research Society, Vol. 64, Iss. 7, 2013-07 ,pp. : 945-958

Palgrave Macmillan Ltd

Access to resources Recommend Favorite

An OR Practitioner's Solution Approach for the Set Covering Problem

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 6, Iss. 4, 2015-10 ,pp. : 1-13

IGI Global_journal

Access to resources Recommend Favorite