Multiparent path relinking. An application to the power dominating set problem
From MaRDI portal
Cites work
- A hybrid heuristic for the \(p\)-median problem
- A note on power domination in grid graphs
- An efficient algorithm for power dominating set
- An iterated greedy algorithm for finding the minimum dominating set in graphs
- An order-based algorithm for minimum dominating set with application in graph mining
- Domination in Graphs Applied to Electric Power Networks
- Fundamentals of scatter search and path relinking
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- GRASP and path relinking for the max-min diversity problem
- GRASP and VNS for solving the \(p\)-next center problem
- Greedy randomized adaptive search procedures
- Multiobjective GRASP with path relinking
- Optimization by GRASP. Greedy randomized adaptive search procedures
- Power domination in cubic graphs and Cartesian products
- Power domination in graphs
- Power domination number of sunlet graph and other graphs
- Resolving-power dominating sets
- Scatter search for the bandpass problem
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Tabu Search—Part I
Cited in
(1)
This page was built for publication: Multiparent path relinking. An application to the power dominating set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891996)