Solving the Minimum Independent Domination Set problem in graphs by exact algorithm and greedy heuristic
Year of publication: |
2013
|
---|---|
Authors: | Laforest, Christian ; Phan, Raksmey |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 47.2013, 3, p. 199-221
|
Subject: | combinatorial optimization | heuristics | exact algorithm | worst case analysis | experimentations | independent dominating set in graphs | Heuristik | Heuristics | Graphentheorie | Graph theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Experiment |
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
-
Liang, Yile, (2024)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
- More ...
-
Hospital flood emergency management planning using Markov models and discrete-event simulation
Zehrouni, Afafe, (2021)
-
Bicriteria scheduling for contiguous and non contiguous parallel tasks
Baille, Fabien, (2008)
-
Bicriteria scheduling for contiguous and non contiguous parallel tasks
Baille, Fabien, (2008)
- More ...