Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic∗

E-ISSN： 1290-3868|47|3|199-221

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.47, Iss.3, 2013-05, pp. : 199-221

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

An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem

By de Sousa Ernando Gomes Santos Andréa Cynthia Aloise Dario José

RAIRO - Operations Research, Vol. 49, Iss. 1, 2014-12 ,pp. : 143-160

Edp Sciences

Access to resources Recommend Favorite

An ex-post bound on the greedy heuristic for the uncapacitated facility location problem

By Thizy Jean-Michel

RAIRO - Operations Research, Vol. 40, Iss. 2, 2006-10 ,pp. : 143-167

Edp Sciences

Access to resources Recommend Favorite

Solving the simple plant location problem by genetic algorithm

By Kratica Jozef Tošic Dušan Filipović Vladimir Ljubić Ivana

RAIRO - Operations Research, Vol. 35, Iss. 1, 2010-03 ,pp. : 127-142

Edp Sciences

Access to resources Recommend Favorite

A convex Hull algorithm for solving a location problem∗

By Linh Nguyen Kieu Muu Le Dung

RAIRO - Operations Research, Vol. 49, Iss. 3, 2015-02 ,pp. : 589-600

Edp Sciences

Access to resources Recommend Favorite

Algorithm for Solving an Optimization Problem for the Temperature Distribution on a Plate

EPJ Web of Conference, Vol. 108, Iss. issue, 2016-02 ,pp. : 02010-02010

Edp Sciences

Access to resources Recommend Favorite