Exact and heuristic algorithms for the domination problem

•A good exact enumeration algorithm for a hard problem is fast in practice.•An integer linear programming (ILP) formulation.•A good exact enumeration algorithm for a hard problem is cable to deal with enough large instances.•A good approximation is important for hard problems.•Graph domination probl...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 313; no. 3; pp. 926 - 936
Main Authors:	Parra Inza, Ernesto, Vakhania, Nodari, Sigarreta Almira, José María, Hernández Mira, Frank Angel
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.03.2024
Subjects:	Combination optimization Dominating set Enumeration algorithm Graph theory Heuristic Time complexity Enumeration algorithm Graph theory Dominating set Combination optimization Time complexity Heuristic
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!