Reoptimization of set covering problems

ISSN： 1060-0396

Source： Cybernetics and Systems Analysis, Vol.46, Iss.6, 2010-11, pp. : 879-883

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

Cooperative covering problems on networks

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 63, Iss. 4, 2014-07 ,pp. : 334-349

John Wiley & Sons Inc

Access to resources Recommend Favorite

On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems

By Mikhailyuk V.

Cybernetics and Systems Analysis, Vol. 47, Iss. 3, 2011-05 ,pp. : 368-374

Springer Publishing Company

Access to resources Recommend Favorite

Requiring Connectivity in the Set Covering Problem

By Cerdeira J. Pinto Leonor

Journal of Combinatorial Optimization, Vol. 9, Iss. 1, 2005-02 ,pp. : 35-47

Springer Publishing Company

Access to resources Recommend Favorite

Approximate Set Covering in Uniform Hypergraphs

By Krivelevich M.

Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. : 118-143

Academic Press

Access to resources Recommend Favorite

Set covering approach for reconstruction of sibling relationships

By Chaovalitwongse W. A. Berger-Wolf T. Y. Dasgupta B. Ashley M. V.

Optimization Methods and Software, Vol. 22, Iss. 1, 2007-02 ,pp. : 11-24

Taylor & Francis Ltd

Access to resources Recommend Favorite